A generalized Grzegorczyk hierarchy and low complexity classes

DOI10.1016/0890-5401(87)90044-7zbMath0637.03036OpenAlexW2097476537MaRDI QIDQ1098838

Mirosław Kutyłowski

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90044-7

zbMATH Keywords

Turing machinesgeneralized Grzegorczyk hierarchy of functions over wordspolynomial computability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Cites Work

• Classes of Predictably Computable Functions
• Some Relations between Classes of Low Computational Complexity
• A Note on “ℰ*0 = ℰ*2?” Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalized Grzegorczyk hierarchy and low complexity classes