[FOM] Wolfram Cellular Automata versus Turing Machines

Steve Stevenson steve at cs.clemson.edu
Tue Jul 8 13:27:31 EDT 2003

Good afternoon,

When Wolfram first started with the CA work in the mid 80s, I seem to
recall that they were shown to be equivalent to linear bounded
automata. Is that right? And if not, may I please have a reference to
a proof of what they really are?

D. E. Stevenson
Computer Science, Clemson University, Clemson, SC 29634-1906 
steve at cs.clemson.edu Phone: (864) 656-5880 Fax: (864) 656-0145 

More information about the FOM mailing list