Firstly, I think it wouldn't be useful when compared to existing algorithms... Cellular automata can be quite heavy to process.
I suspect the problem you will run into this that you cannot reliably say that additional variations will for sure result in significant changes in n ticks of the simulation.
What could be interesting though is Langton's Ant, as you can for sure make guarantees that the next iteration will result in some change in the output - and it should in theory always be entirely reversible if you want it to be. You could easily make it non-reversible by presenting some sub-set of the space for use in verification for example.
10 comments
[ 4.7 ms ] story [ 34.7 ms ] threadWould be nice to know who originated the idea.
Tempted to have a go at it with MetaFont, actually, since I've been meaning to get around to that since about 1993.
Does that make it a neat option for... Hashing?
I could write a sentence and run it some number of iterations. And it would be easy to verify it.
I suspect the problem you will run into this that you cannot reliably say that additional variations will for sure result in significant changes in n ticks of the simulation.
What could be interesting though is Langton's Ant, as you can for sure make guarantees that the next iteration will result in some change in the output - and it should in theory always be entirely reversible if you want it to be. You could easily make it non-reversible by presenting some sub-set of the space for use in verification for example.