Talk:Turing Machine

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

Unused subpages
Unused subpages: - Bibliography - External Links - Works - Discography - Filmography - Catalogs - Timelines - Gallery - Audio - Video - Code - Tutorials - Student Level - Signed Articles - Function - Addendum - Debate Guide - Advanced - Recipes - Citable Version

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

Talk:Turing Machine

Related machine and concepts

Navigation menu

Search