A class of exp-time machines which can be simulated by polytape machines

  • B. Scarpellini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)


Binary String Canonical Extension Geometrical Reason Register Machine Input Tape 
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. Böhling KH, Braunmuhl Bv (1974) Komplexität bei Turingmaschinen. Bibliographisches Institut, Mannheim/Wien/ZürichGoogle Scholar
  2. Scarpellini B (1985) Lower bound results on lengths of second order formulas. Annals of Pure and Applied Logic 29: 29–58Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • B. Scarpellini
    • 1
  1. 1.Math. Institute of University of BaselBaselSwitzerland

Personalised recommendations