Turing Machines with Sublogarithmic Space by Andrzej SzepietowskiTuring Machines with Sublogarithmic Space by Andrzej Szepietowski

Turing Machines with Sublogarithmic Space

byAndrzej Szepietowski

Paperback | August 29, 1994

Pricing and Purchase Info

$114.32 online 
$128.95 list price save 11%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Turing Machines with Sublogarithmic SpaceFormat:PaperbackDimensions:123 pagesPublished:August 29, 1994Publisher:Springer Berlin Heidelberg

The following ISBNs are associated with this title:

ISBN - 10:3540583556

ISBN - 13:9783540583554

Look for similar items by category:

Reviews

Table of Contents

Basic Notions.- Languages acceptable with logarithmic space.- Examples of languages acceptable with sublogarithmic space.- Lower bounds for accepting non-regular languages.- Space constructible functions.- Halting property and closure under complement.- Strong versus weak mode of space complexity.- Padding.- Deterministic versus nondeterministic Turing machines.- Space hierarchy.- Closure under concatenation.- Alternating hierarchy.- Independent complement.- Other models of Turing machines.