Advertisement

About this book

Introduction

This comprehensive monograph investigates the computational power of Turing machines with sublogarithmic space. The studies are devoted to the Turing machine model introduced by Stearns, Hartmanis, and Lewis (1965) with a two-way read-only input tape and a separate two-way read-write work tape. The book presents the key results on space complexity, also as regards the classes of languages acceptable, under the perspective of a sublogarithmic number of cells used during computation. It originates from courses given by the author at the Technical University of Gdansk and Gdansk University in 1991 and 1992. It was finalized in 1994 when the author visited Paderborn University and includes the most recent contributions to the field.

Keywords

Automata Theory Automatentheorie Halteproblem Halting Problem Mathematical Logic Mathematische Logik Space-Bounded Computation Speicherplatzbeschränktes Rechnen Turing Machines Turing-Maschinen complexity

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-58355-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58355-4
  • Online ISBN 978-3-540-48669-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site