Complexity of computable functions for a generalized storage measure

DOI10.1007/BF01163281MaRDI QIDQ1168076zbMATH OpenFDO

Authors V. L. Matrosov

Publication date 1981

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

abstract complexityconstructible functionsGrzegorczyk hierarchyhierarchy theorem for space complexityspace measurestorage measure

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168076)