Message Boards Message Boards

If "a" is cellular automaton and "b" machine language, then is a<b? Or can a=b?

Is the reduction of machine language into cellular automaton thorough? Or are there elements outside of this reduction? Are certain "Mathematica Rules" usually here but incomplete in any reverse engineering into cellular automaton?
POSTED BY: Geoffrey Nicoletti
2 Replies
Sort By:

Rule 110 is Turing complete. Does that answer your question?
POSTED BY: Daniel Lichtblau

Yes, that is helpful. I'm looking at details like parsing, tokens, kernels and it is helpful to imagine a Wolfram or Donald Knuth view below high-level code. If Grace Hopper created a metalanguage because lines of code were getting to be "many", what small projects would benefit from a "cellular automaton" view? So I will ask myself what is possible with Rule 110.
POSTED BY: Geoffrey Nicoletti
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Tag limit exceeded
Note: Only the first five people you tag will receive an email notification; the other tagged names will appear as links to their profiles.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract