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?
Rule 110 is Turing complete. Does that answer your question?
