Comment by shagie

> Does aperiodicity have any cool properties that help in specific domains?

The proof of the aperiodic nature of the Wang tile set was showing that a Turing machine could be created out of Wang Tiles that tile the plane (periodic) if and only if the Turing machine does not halt. (I think I phrased that right)

https://en.wikipedia.org/wiki/Wang_tile

> In 1966, Berger solved the domino problem in the negative. He proved that no algorithm for the problem can exist, by showing how to translate any Turing machine into a set of Wang tiles that tiles the plane if and only if the Turing machine does not halt. The undecidability of the halting problem (the problem of testing whether a Turing machine eventually halts) then implies the undecidability of Wang's tiling problem.

...

This means that you can create tiles that solve specific computations. Andrew Glassner's notebooks has a chapter on aperiodic tiles ( https://archive.org/details/andrewglassnersn0000glas/page/18... ) Page 216 has a tile set that finds the minimum of two numbers.

There's also some "if you use Wang Tiles you can pattern textures without repeating groups" - https://www.researchgate.net/publication/2864579_Wang_Tiles_...