Comment by praptak | Hacker News Reader

Top New Best Ask Show Jobs

Comment by praptak | Hacker News Reader

The completeness of CTS was also used in the proof of completeness of the 2-state 3-symbol Turing machine.

thanks, I wasn't aware of that. Do you have the reference?

The Wikipedia has some links: http://en.wikipedia.org/wiki/Wolfram%27s_2-state_3-symbol_Tu...

Reply on news.ycombinator.com