25 citations · 122 across the 26 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2015★ 10 cited
Translation-like Actions and Aperiodic Subshifts on Groups
Emmanuel Jeandel
It is well known that if admits a f.g. subgroup with a weaklyaperiodic SFT (resp. an undecidable domino problem), then itself has a weakly aperiodic SFT (resp. an undeci…
cs.FL2013
Computability of the entropy of one-tape Turing Machines
Emmanuel Jeandel
We prove that the maximum speed and the entropy of a one-tape Turing machine are computable, in the sense that we can approximate them to any given precision . This is contrary…
cs.FL2012★ 3 cited
Fixed Parameter Undecidability for Wang Tilesets
Emmanuel Jeandel, Nicolas Rolin
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are…