A sequence of complexly computable functions

DOI10.1007/BF01442706zbMath0335.94021MaRDI QIDQ1229680

L. A. Sholomov

Publication date: 1975

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

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

A note on dimensions of polynomial size circuits

Cites Work

• Classes of Predictably Computable Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item