3 ms·
Tilings are a neat way to simulate Turing machines, so it's not super surprising that they show up in an undecidability proof: https://en.wikipedia.org/wiki/Wa
by adrianN 11y ago
Tilings are a neat way to simulate Turing machines, so it's not super surprising that they show up in an undecidability proof:
https://en.wikipedia.org/wiki/Wang_tile https://en.wikipedia.org/wiki/Wang_tile