Turing Machines with Sublogarithmic Space
Author:   Andrzej Szepietowski
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   1994 ed.
Volume:   843
ISBN:  

9783540583554


Pages:   114
Publication Date:   29 August 1994
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $139.79 Quantity:  
Add to Cart

Share |

Turing Machines with Sublogarithmic Space


Overview

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.

Full Product Details

Author:   Andrzej Szepietowski
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1994 ed.
Volume:   843
Dimensions:   Width: 15.50cm , Height: 0.70cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9783540583554


ISBN 10:   3540583556
Pages:   114
Publication Date:   29 August 1994
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now