Elsevier

Information and Computation

Volume 72, Issue 2, February 1987, Pages 133-149
Information and Computation

A generalized Grzegorczyk hierarchy and low complexity classes

https://doi.org/10.1016/0890-5401(87)90044-7Get rights and content
Under an Elsevier user license
open archive

Abstract

We recall the notion of the generalized Grzegorczyk hierarchy and we discuss some problems connected with its initial classes. We establish equalities between initial generalized Grzegorczyk classes and some Turing machine complexity classes such as P and P ∗ LINSPACE. Using the means of Grzegorczyk classes we prove a certain hierarchy theorem for the class P LINSPACE. Stack Turing machines are introduced for better description of low complexity classes.

Cited by (0)

Present address: Computer Science Institute, University of Wrocław, ul. Przesmyckiego 20. 51-151 Wrocław, Poland.