All Questions
6 questions
4
votes
0
answers
171
views
Undecidability for hyperbolic Wang-tilings - pentagons, heptagons, octagons, oh my!
Berger proved that the problem of determining if a finite set of Wang tiles can tile the plane is undecidable. Robinson reproved Berger's result and raised the question of considering the ...
9
votes
3
answers
846
views
Conjecture on NP-completeness of tesselation of Wang Tile up to finite size
Motivated by these following questions on tessellation:
coloring in lattice
Reference for Wang Tile
Computational approach deciding whether a set of Wang Tile could tile the space up to some size
...
5
votes
1
answer
405
views
Computational approach deciding whether a set of Wang Tile could tile the space up to some size
As an applied person, I'm facing one practical problem deciding whether a set of Wang tile could tile the plane periodically or aperiodically. Although both problems seem undecidable, but I'm on a ...
10
votes
2
answers
803
views
Reference for Wang tile
I am working on projects in solving ground state of generalized Ising models. One recent work involves tiling with basic tiles that filled the whole lattice. For example, we could obtain results:
...
2
votes
0
answers
169
views
Are there any recommended texts that cover Turing Tilings?
I have read the original paper by Wang, as well as a paper by Boas [1996] entitled 'the Convenience of Tilings', but wanted to know if there were any other texts that people could recommend that ...
17
votes
3
answers
2k
views
Decidability of tiling R^2
Does there exist a closed curve, with finite area and finite circumference, of which it is undecidable (in an axiomatic system where it is constructable) whether it can tile the plane?
I know the ...