>> Exhibit B: Rule 30 can be stated in 8 equations. Oh, did I mention? 
>> It's Turing-complete. It can compute any computable function.
> 
> You know, he says that, but I'm pretty sure a CA with an infinite amount 
> of initialization counts as Turing-equivalent.

The point being that some rules can't emulate a Turing machine, while 
others can. E.g., rule 0 maps every possible input to 0, so you can't do 
very much with that. Rule 2 maps each 1-bit input to the same output. 
And so on. Only a few of the possible rules are Turing-complete.

-- 
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*

Post a reply to this message