Complexity of computable functions for a generalized storage measure

DOI10.1007/BF01163281zbMath0492.68042MaRDI QIDQ1168076

V. L. Matrosov

Publication date: 1981

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

constructible functionsGrzegorczyk hierarchyabstract complexityhierarchy theorem for space complexityspace measurestorage measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• An Overview of the Theory of Computational Complexity
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage

This page was built for publication: Complexity of computable functions for a generalized storage measure