Machine-independent description of certain machine complexity classes

DOI10.1007/BF01629446zbMath0493.03014OpenAlexW2015596941MaRDI QIDQ1168310

S. V. Pakhomov

Publication date: 1982

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01629446

zbMATH Keywords

classes of functions computable by Turing machines within bounded space and timemachine complexity classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Complexity questions in number theory

Cites Work

• A recursive and a grammatical characterization of the exponential-time languages
• Classes of Predictably Computable Functions
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage
• Unnamed Item

This page was built for publication: Machine-independent description of certain machine complexity classes