>>20983
>Is there more than one Cellular automata?
There is an infinite number, though I'm not sure which infinity.
Thanks for the link.
If you're interested in cellular automata check out rule 110, and conways game of life; they're both turing-complete which is literally awesome.
>Also, "O" represents the complexity of the algorithm.
No, it doesn't, and he isn't.
Saying an algorithm is in O(N·I) is to say that the value of the function f(n,i)=n·i multiplied by a constant when both n and i are at or above constant minimum values is always larger than some metric of your algorithm for the same values of n and i.
In this case the metric was, implicitly, CPU instructions.