News for hackers. Stuff that matters.
Re:Turing's topological proof that every written alphabet is... by snthpy on Wednesday July 24, 2024 @02:32AM (#41054171)
I totally agree with your argument. However just to throw out an idea for a possible counterexample (as mathematicians like to do):

What if you used aperiodic Penrose tiles and could detect intensity? Would it be possible to encode anything in that? There would be no repetition but when would you hit limits of discernability with all the overwriting?

Re:Turing's topological proof that every written alphabet is... by snthpy on Wednesday July 24, 2024 @02:34AM (#41054183)
I mean the number of tiles is finite but what if the alphabet was the encoded in the geometrical arrangement of the tiles?
Re:Turing's topological proof that every written alphabet is... by snthpy on Wednesday July 24, 2024 @02:37AM (#41054192)
Ignore me. That's no different to having infinite length strings with a finite alphabet.