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.

Bibliographic Information

Book Title: Turing Machines with Sublogarithmic Space
Editors: Andrzej Szepietowski
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-58355-6
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1994
Softcover ISBN: 978-3-540-58355-4Published: 29 August 1994
eBook ISBN: 978-3-540-48669-5Published: 05 August 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 114
Topics: Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Mathematical Logic and Foundations

Publish with us

Policies and ethics

Turing Machines with Sublogarithmic Space

Overview

Access this book

Other ways to access

Table of contents (15 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation