A universal Turing machine

  • Stål Aanderaa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 702)


The aim of this paper is to give an example of a universal Turing machine, which is somewhat small. To get a small universal Turing machine a common constructions would go through simulating tag system (see Minsky 1967). The universal machine here simulate two-symbol Turing machines directly.


Mathematical Logic Turing Machine Formal Language Number System Binary Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Minsky, Marvin Computation: Finite and Infinite Machines. Prentice-Hall 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Stål Aanderaa
    • 1
  1. 1.University of OsloNorway

Personalised recommendations