factual

Tiling as algorithmic self-assembly link to Turing machines

Colored tile sets that bind only when colors match can be designed to simulate Turing machines and cellular automata, following Hao Wang's aperiodic tiling work, so physical molecular tapestries can embody algorithmic self-assembly grounded in mathematical tiling theory.

factualpending

Speaker

Erik Winfree

Evidence Quote

“Hao Wang developed with his students some of the first really interesting aperiodic square tilings and noticed that, in fact, you can design sets of tiles that just stick to each other when the colors match”

Source

372 | Erik Winfree on DNA Computers and Robots— Sean Carroll's Mindscape
Created: 11/17/2026, 6:37:26 AM

Your notes

Loading notes...