Turing Machine
An abstract model of computation consisting of an infinitely long tape, a read-write head, and a finite-state controller; it is a foundation of computation theory and the study of computability.
Timeline (last 90 days)
The ideas of computational functionalism can be traced back to the functionalist turn in the mid-20th century and are closely related to the Turing machine model and the computer metaphor in cognitive science.
A Turing machine consists of an infinitely long tape, a read/write head, and a finite state transition table, and each step's action is uniquely determined by the current state and the symbol read.
In computational theory, an oracle is an extension of the Turing machine model, endowed with a black box that can answer a specific decision problem in a single step.
The busy beaver function BB(n) is defined as the maximum number of 1s that an n-state, two-symbol Turing machine can write when it finally halts.
All Facts (4)
The ideas of computational functionalism can be traced back to the functionalist turn in the mid-20th century and are closely related to the Turing machine model and the computer metaphor in cognitive science.
50%UnverifiedA Turing machine consists of an infinitely long tape, a read/write head, and a finite state transition table, and each step's action is uniquely determined by the current state and the symbol read.
50%UnverifiedIn computational theory, an oracle is an extension of the Turing machine model, endowed with a black box that can answer a specific decision problem in a single step.
50%UnverifiedThe busy beaver function BB(n) is defined as the maximum number of 1s that an n-state, two-symbol Turing machine can write when it finally halts.
50%