Skip to main content
SpringerLink
Log in

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

  • Chapter
  • First Online:
Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 270))

  • 131 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Böhling KH, Braunmuhl Bv (1974) Komplexität bei Turingmaschinen. Bibliographisches Institut, Mannheim/Wien/Zürich

    Google Scholar 

  • Scarpellini B (1985) Lower bound results on lengths of second order formulas. Annals of Pure and Applied Logic 29: 29–58

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math. Institute of University of Basel, 4051, Basel, Switzerland

    B. Scarpellini

Authors
  1. B. Scarpellini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Scarpellini, B. (1987). A class of exp-time machines which can be simulated by polytape machines. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_175

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_175

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation