A model of computation studied in TheoComp?, CS81, CS60, and probably elsewhere. The most powerful model of computation there is, if you believe the Church-Turing Hypothesis, and I know I do.

Formally, it's a 7-tuple M = (Q, Sigma, Gamma, delta, q_0, q_accept, q_reject) where Q, Sigma, and Gamma are finite sets, and the following conditions hold:

Turing Machines are named for AlanTuring, a brilliant British mathematician who deserves a Wiki page all his own.

The main CS server used to be a machine named Turing. It was not, however, just a TuringMachine.

FunWiki | RecentChanges | Preferences
Edit text of this page | View other revisions
Last edited April 21, 2008 18:51 (diff)