Iterative Characterizations of Computable Unary Functions: A General Method

DOI10.1002/MALQ.19970430104zbMATH Open0868.03018OpenAlexW2036996472MaRDI QIDQ4333464FDOQ4333464

Authors: S. Mazzanti 

Publication date: 19 August 1997

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19970430104

Recommendations

• Succinct iterative characterizations of primitive computable unary functions
• A new characterization of computable functions
• Uniformly computable aspects of inner functions
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
• General iteration and unary functions
• Computability theory of generalized functions
• Recursive characterization of computable real-valued functions and relations
• Uniform and conditional-computability of some nonelementary real functions
• Bounded iteration and unary functions
• Universal computable enumerations of finite classes of families of total functions

zbMATH Keywords

computable functionsiteration operatorsfunctional closurepairing operator

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (5)

• Primitive iteration and unary functions
• Impossibility of finite generation of partial recursive functions by a unary isotone operation
• Bounded iteration and unary functions
• Iteration on notation and unary functions
• Succinct iterative characterizations of primitive computable unary functions

This page was built for publication: Iterative Characterizations of Computable Unary Functions: A General Method

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