In 1937, A.M. Turing proposed a machine model for defining computability. We shall use Turing’s model for defining the computable word functions f:(W(Σ))k → W(Σ), where Σ is an alphabet. The physical model of a Turing machine is a tape on which a read/write head operates controlled by a finite device (or a flowchart) like a computer operates on a potentially infinite magnetic tape.
KeywordsTuring Machine Computable Function Word Function Bibliographical Note Register Machine
Unable to display preview. Download preview PDF.