3 ms·
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 _
by ncallaway 14y ago
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.