Revision as of 20:11, 30 January 2008 edit Trovatore (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,110 edits →Deciding a language: string in or out ← Previous edit		Revision as of 22:30, 30 January 2008 edit undo Dcoetzee (talk \| contribs) 37,529 edits →confusion PCs are not FSMs Next edit →
Line 271: How is the following statement confusing? ''"Actually, these are computer programs written in general-purpose programming languages which are Turing Machines (the GP languages are, therefore, called Turing-complete), while the actual computers executing the programs are FSMs."'' I have included it into the article even before looking into the discussion to disambiguate the popular confusion: [http://groups.google.com/group/sci.math/browse_frm/thread/a19842fff35d1ca2/e7d0c7b501d31e8c?lnk=st&q=PC+fsm+turing+poll&rnum=1#e7d0c7b501d31e8c "Poll: Are PCs Turing Machines?"] Thi is the actual and vast confusion. What I see at this page proves my doubts. Please explain what is so confusing in my sentence? Peahaps it is rather wrong or inappropriate? --[[User:Javalenok\|Javalenok]] 09:02, 13 June 2006 (UTC) :I don't know what "confusion" you're referring to. Your statement is accurate, but the English is difficult to understand, and I'm not sure how much it adds in this context. [[User:Dcoetzee\|Dcoetzee]] 22:30, 30 January 2008 (UTC) == Church-Turing thesis ==

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