Talk:Turing Machine: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Louise Valmoria
({{subpages}})
 
imported>Warren Schudy
No edit summary
Line 1: Line 1:
{{subpages}}
{{subpages}}
--[[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.

Revision as of 17:56, 1 January 2008

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition A theoretical computing device, first posited by mathematician Alan Turing, which has been used extensively in analyzing computing problems such as tractability and complexity theory. [d] [e]
Checklist and Archives
 Workgroup category Computers [Editors asked to check categories]
 Talk Archive none  English language variant American English

--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.