Revision as of 15:59, 6 June 2006 edit Readams (talk \| contribs) 126 edits →Cleanup ← Previous edit		Revision as of 18:43, 9 June 2006 edit undo Javalenok (talk \| contribs) Extended confirmed users 799 edits →Desktop PCs are not considered to be FSMs Next edit →
Line 118: --[[User:Exa\|Exa]] 15:41, 22 January 2006 (UTC) :''"It does not mean that physical machines cannot be TMs!"'' -- All the real HW pcs. are FSMs and, hence, are TMs. :''"Every TM denotes a particular computation"'' -- The TMs are SW programs executed by particular HW FSM. --[[User:Javalenok\|Javalenok]] 18:43, 9 June 2006 (UTC) :Except inasmuch as they behave nondeterministically, desktop machines are finite state machines. You might argue that it's more useful to treat them using the theory of Turing machines, and I'd tend to agree, but in the strictest mathematical sense they aren't Turing machines.

Talk:Computability theory (computer science): Difference between revisions