1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.FL2025
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…
math.LO2022★ 1 cited
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…