Tape Machines

  • Klaus Weihrauch
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 9)

Abstract

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.

Keywords

Prefix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.FB Mathematik und InformatikFern Universität HagenHagenGermany

Personalised recommendations