A note on A.E. h-complex functions

DOI10.1016/0022-0000(90)90006-7zbMath0694.68031OpenAlexW1995479936MaRDI QIDQ909459

Mark A. Fulk

Publication date: 1990

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(90)90006-7

zbMATH Keywords

computational complexitycomplexity theoryrecursive functions

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)

Related Items

On recursive bounds for the exceptional values in speed-up, Effective category and measure in abstract complexity theory, Effective category and measure in abstract complexity theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on arbitrarily complex recursive functions
• Independence results in computer science?
• Theory of Formal Systems. (AM-47)
• A Machine-Independent Theory of the Complexity of Recursive Functions