On a complexity-based way of constructivizing the recursive functions

DOI10.1007/BF00401559zbMATH Open0711.03014MaRDI QIDQ922528FDOQ922528

Authors: F. W. Kroon, Walter A. Burkhard 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 218515
• Effective choice of constructivizations and recursive consistency of problems on constructive models
• scientific article; zbMATH DE number 2013793
• On effective choice of constructivizations
• scientific article; zbMATH DE number 65741

zbMATH Keywords

hierarchiesconstructively computable functionconstructivization of recursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Title not available (Why is that?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Augmented loop languages and classes of computable functions
• Computability of Recursive Functions
• Extension of an effectively generated class of functions by enumeration
• Classes of Predictably Computable Functions
• Title not available (Why is that?)
• A Hierarchy of Primitive Recursive Functions

Cited In (5)

• Title not available (Why is that?)
• The intrinsic difficulty of recursive functions
• Recursive constructions for large caps
• Tailoring recursion for complexity
• Title not available (Why is that?)

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

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