Content deleted Content added
m Robot-assisted disambiguation (you can help!): Quine |
Church-Turing thesis |
||
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)
== Church-Turing thesis ==
This discussion is copied from the user page.
You changed [[Church-Turing thesis]] to claim that it had been disproven. This is certainly not the case. Please feel free to discuss your changes on the talk page of the article. [[User:CMummert|CMummert]] · <small>[[User talk:CMummert|talk]]</small> 10:49, 12 April 2007 (UTC)
:The [[Church-Turing thesis]] has ''not'' been disproved. However, it needs to be stately precisely which was not done in the previous version of the article. It is very important to distinguish between computable '''functions''' and computability ('''computations''').--[[User:71.198.216.63|71.198.216.63]] 16:11, 12 April 2007 (UTC)
| |||