Convex and discrete geometry Example
Wang tile
Builds on Turing machineUndecidability of the halting problem
Example
A Wang tile is a unit square whose four edges carry colours from a finite set. Fix a finite set of Wang tiles. A tiling by is a map such that adjacent edges match. That is, for each , the right edge of has the colour of the left edge of . Also the top edge of has the colour of the bottom edge of . Tiles may not be rotated or reflected.
The set of all tilings by is a two-dimensional subshift of finite type in . Indeed, its forbidden patterns are the pairs of adjacent tiles whose common edge has two different colours. There are finitely many of them.
Check of a small case: let consist of one tile whose four edges all have the colour . All matching conditions hold, so the constant map is a tiling, and it is periodic. Now let consist of one tile with left edge and right edge . Two such tiles can never sit side by side, so admits no tiling.
Remarks
The domino problem asks for an algorithm that decides, given , whether tiles the plane. Berger proved that no such algorithm exists, by simulating a Turing machine with Wang tiles and reducing to the halting problem. A key step is the existence of an aperiodic set of Wang tiles: a set that tiles the plane, but only in non-periodic ways. Jeandel and Rao found an aperiodic set of Wang tiles and showed that no set with fewer tiles is aperiodic.
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Computable set concept
- Function concept
- Gödel numbering concept
- Set concept
- Turing machine concept
- Turing machine definition
- Undecidability of the halting problem statement
- Wang tile example
Further reading
About this page
| Tag | BBYNPDWR5R |
|---|---|
| URI | m2://BBYNPDWR5R |
| Kind | example |
| Writing | W0 stub |
| MSC | 52C20, 05B45, 37B51 |
| Illustrates | Subshift of finite type |
| Uses | Turing machine, Undecidability of the halting problem |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.