A New Hierarchy of Elementary Functions

DOI10.2307/2035699MaRDI QIDQ5570927zbMATH OpenOpenAlexFDO

Authors Gabor T. Herman

Publication date 1969

Full work available at URL https://doi.org/10.2307/2035699

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• A Hierarchy of Primitive Recursive Functions
• Classes of Predictably Computable Functions
• Computability of Recursive Functions
• Enumeration and the Grzegorczyk Hierarchy
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• On Formalisms for Turing Machines

Cited in

(4)

• Complexity of algorithms and computations
• Small universal Turing machines
• Arithmetic terms for sums of multinomial coefficients
• Numeral completeness of weak theories of arithmetic

This page was built for publication: A New Hierarchy of Elementary Functions

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