A proof is claimed that determining whether a set of five polyominoes can tile the plane is undecidable, via a new edge-labeling construction.
Wang, Proving theorems by pattern recognition-II , Bell System Technical Journal 40 (1961), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Undecidability of Tiling the Plane with a Set of 5 Polyominoes
A proof is claimed that determining whether a set of five polyominoes can tile the plane is undecidable, via a new edge-labeling construction.