Talk:Turing Machine: Difference between revisions
Jump to navigation
Jump to search
imported>Warren Schudy No edit summary |
imported>Howard C. Berkowitz (→Related machine and concepts: new section) |
||
Line 2: | Line 2: | ||
--[[User:Warren Schudy|Warren Schudy]] 17:56, 1 January 2008 (CST) This page was actually defining Turing Completeness, not Turing Machine. A Turing Machine is a specific computational model. A Turing Complete machine is any machine that can simulate a Turing Machine. Wikipedia's article on Deterministic Turing Machine is pretty good, so I suggest that we import it. I just ended the existing article a bit to avoid confusing readers in the interim. | --[[User:Warren Schudy|Warren Schudy]] 17:56, 1 January 2008 (CST) This page was actually defining Turing Completeness, not Turing Machine. A Turing Machine is a specific computational model. A Turing Complete machine is any machine that can simulate a Turing Machine. Wikipedia's article on Deterministic Turing Machine is pretty good, so I suggest that we import it. I just ended the existing article a bit to avoid confusing readers in the interim. | ||
== Related machine and concepts == | |||
Was Alan Turing's bicycle his Touring Machine? Is there an Italian Gran Turing version? | |||
Should Turing Test link from here? [[User:Howard C. Berkowitz|Howard C. Berkowitz]] |
Revision as of 11:57, 4 July 2009
--Warren Schudy 17:56, 1 January 2008 (CST) This page was actually defining Turing Completeness, not Turing Machine. A Turing Machine is a specific computational model. A Turing Complete machine is any machine that can simulate a Turing Machine. Wikipedia's article on Deterministic Turing Machine is pretty good, so I suggest that we import it. I just ended the existing article a bit to avoid confusing readers in the interim.
Related machine and concepts
Was Alan Turing's bicycle his Touring Machine? Is there an Italian Gran Turing version?
Should Turing Test link from here? Howard C. Berkowitz