Ordinal Hierarchies and Naming Complexity Classes

DOI10.1145/321784.321793zbMath0339.68038OpenAlexW2082191047MaRDI QIDQ4107929

No author found.

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321784.321793

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Related Items

The intrinsic difficulty of recursive functions, The non-renamability of honesty classes, Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems