That suggests that the layout at some radius R in the distance is unpredictable without "running" it, in the Wolfram computational-irreducible sense. They say

That suggests that the layout at some radius R in the distance is unpredictable without "running" it, in the Wolfram computational-irreducible sense. They say they have "a new kind of geometric incommensurability argument", and there are many statements about the related undecidability of related tiling classes.. but not really grokking this. Anyone know?