1 citations · 1 across the 3 of their papers we have counts for
4 papers
Minimality and computability of languages of G-shifts
Djamel Eddine Amir, Benjamin Hellouin de Menibus
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for -shifts, where is a finitely generated…
The surjection property and computable type
Djamel Eddine Amir, Mathieu Hoyrup
We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to character…
Strong computable type
Djamel Eddine Amir, Mathieu Hoyrup
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable…
Computability of finite simplicial complexes
Djamel Eddine Amir, Mathieu Hoyrup
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X…