The domino problem is decidable for robust tilesets
The domino problem is decidable for robust tilesets
One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be undecidable in general and even …