Turing Machines with Sublogarithmic Space

Paperback Engels 1994 1994e druk 9783540583554
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540583554
Taal:Engels
Bindwijze:paperback
Aantal pagina's:114
Uitgever:Springer Berlin Heidelberg
Druk:1994

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Turing Machines with Sublogarithmic Space