3 ms·
The completeness of CTS was also used in the proof of completeness of the 2-state 3-symbol Turing machine.
by praptak 14y ago
The completeness of CTS was also used in the proof of completeness of the 2-state 3-symbol Turing machine.
- barvinograd 14y agothanks, I wasn't aware of that. Do you have the reference?
- praptak 14y agoThe Wikipedia has some links: http://en.wikipedia.org/wiki/Wolfram%27s_2-state_3-symbol_Turing_machine#Proof_of_universality http://en.wikipedia.org/wiki/Wolfram%27s_2-state_3-symbol_Tu...