A sequence of complexly computable functions

DOI10.1007/BF01442706MaRDI QIDQ1229680zbMATH OpenFDO

Authors L. A. Sholomov

Publication date 1975

Published in Mathematical Notes (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3427323 (Why is no real title available?)
• scientific article; zbMATH DE number 3205680 (Why is no real title available?)
• scientific article; zbMATH DE number 3285248 (Why is no real title available?)
• Classes of Predictably Computable Functions

Cited in

(1)

• A note on dimensions of polynomial size circuits

This page was built for publication: A sequence of complexly computable functions

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