|
|
|
|
|
|
by chriswarbo
1121 days ago
|
|
|
Tilings can encode arbitrary computation. For example, any Turing machine can be encoded as a set of Wang tiles. Some shapes can tile the plane; others can't (they inevitably get stuck, with no space to attach new copies without overlap). This is precisely the Halting Problem. One famous application of this is to encode these shapes using complementary snippets of DNA, to perform massively-parallel computation at the nano-scale: https://www.nature.com/articles/35035038 |
|
|