5 search results - page 1 / 1 » The Domino Problem of the Hyperbolic Plane Is Undecidable |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
TCS
2010
13 years 3 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...