Re:What is the enlightenment I'm supposed to attain after st...
by ncallaway on Monday December 24, 2012 @01:07PM
(#4963573)
robrenaud did not respond to the argument that the PC is a Finite Automata.
His only comment was that "Finite Automata are quite weak" (in the context of the _theoretical difference_ between Turing machines and FA). He's absolutely correct. FA can compute a strict subset of what Turing machines can compute.
His only comment was that "Finite Automata are quite weak" (in the context of the _theoretical difference_ between Turing machines and FA). He's absolutely correct. FA can compute a strict subset of what Turing machines can compute.