A survey of classes of primitive recursive functions

DOI10.1145/3588287.3588305MaRDI QIDQ6979504zbMATH OpenFDO

Authors Stephen Cook

Publication date 25 May 2025

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Computer science (68-XX) Theory of computing (68Qxx)

Cites work

• Classes of languages and linear-bounded automata
• Classes of Predictably Computable Functions
• Computability of Recursive Functions
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• On certain formal properties of grammars
• Theory of Formal Systems. (AM-47)

This page was built for publication: A survey of classes of primitive recursive functions

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