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.

Lecture Notes in Computer Science. Turing Machines with Sublogarithmic Space. This comprehensive monograph investigates the computational power of Turing machines with sublogarithmic space

Lecture Notes in Computer Science. Authors: Szepietowski, Andrzej. 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.

Series: Lecture Notes in Computer Science 84.

Although some important problems still remain open, much work has been done, and many exciting results have been obtained.

The book presents the key results on space complexity, also as regards th. .

Turing Machines with Sublogarithmic Space - Lecture Notes in Computer Science 843 (Paperback). Andrzej Szepietowski (author). It originates from courses given by the author at the Technical University of Gdansk and Gdansk University in 1991 and 1992.

A note on alternating one-pebble Turing machines with sublogarithmic space. cle{Szepietowski2006ANO, title {A note on alternating one-pebble Turing machines with sublogarithmic space}, author {Andrzej Szepietowski}, journal {Inf. year {2006}, volume {98}, pages {174-176} }. Andrzej Szepietowski.

Range Minimum Queries and Applications. Lecture Notes in Computer Science. Hon Wai Leong Department of Computer Science, School of Computing National University of Singapore Singapore Singapore. Wing-Kin Sung Department of Computer Science, School of Computing National University of Singapore Singapore Singapore. ISSN 1611-3349 (electronic). ISBN 978-3-319-94666-5. ISBN 978-3-319-94667-2 (eBook).

A note on accelerated Turing machines. December 2010 · Mathematical Structures in Computer Science. In this paper we prove that any Turing machine that uses only a finite computational space for every input cannot solve an uncomputable problem even when it runs in accelerated mode.

Germany - SIR Ranking of Germany. The set of journals have been ranked according to their SJR and divided into four equal groups, four quartiles. Q1 (green) comprises the quarter of the journals with the highest values, Q2 (yellow) the second highest values, Q3 (orange) the third highest values and Q4 (red) the lowest values. Computer Science (miscellaneous). Q2.

Start display at page: Download "Lecture Notes in Computer Science .

Start display at page: Download "Lecture Notes in Computer Science 5115". Error: Download Document.

Lecture Notes in Computer Science is a series of computer science books published by Springer Science+Business Media since 1973. The series contains proceedings, post-proceedings, and monographs. In addition, tutorials, state-of-the-art surveys, and "hot topics" are increasingly being included. Two sub-series are: Lecture Notes in Artificial Intelligence. Lecture Notes in Bioinformatics. Monographiae Biologicae, another monograph series published by Springer Science+Business Media.

The theorem can be proven by showing how to translate any nondeterministic Turing machine M into another nondeterministic Turing machine that solves the complementary decision problem under O of the same space constraints, plus a constant number of pointers and counters, which needs only a logarithmic amount of space. For a stronger padding argument that applies even to sublogarithmic space complexity classes, see Szepietowski, Andrzej (1994), Turing machines with sublogarithmic space, Lecture Notes in Computer Science, 843, Springer-Verlag, Berlin, doi:10. 1007/3-540-58355-6, ISBN 3-540-58355-6, MR 1314820.