A sequence of complexly computable functions

DOI10.1007/BF01442706zbMATH Open0335.94021MaRDI QIDQ1229680FDOQ1229680

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Classes of Predictably Computable Functions
• Title not available (Why is that?)

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)