On a complexity-based way of constructivizing the recursive functions

DOI10.1007/BF00401559zbMath0711.03014MaRDI QIDQ922528

F. W. Kroon, Walter A. Burkhard

Publication date: 1990

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

hierarchiesconstructively computable functionconstructivization of recursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

The intrinsic difficulty of recursive functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Augmented loop languages and classes of computable functions
• Extension of an effectively generated class of functions by enumeration
• Classes of Predictably Computable Functions
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computability of Recursive Functions
• A Hierarchy of Primitive Recursive Functions

This page was built for publication: On a complexity-based way of constructivizing the recursive functions