Succinct iterative characterizations of primitive computable unary functions

DOI10.1016/0020-0190(95)00167-0MaRDI QIDQ672834zbMATH OpenOpenAlexFDO

Authors S. Mazzanti

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00167-0

zbMATH Keywords

Theory of computationIterationPrimitive computable functions

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Primitive iteration and unary functions
• Iterative Characterizations of Computable Unary Functions: A General Method
• Unary primitive recursive functions

Cites work

• scientific article; zbMATH DE number 4033724 (Why is no real title available?)
• scientific article; zbMATH DE number 3506659 (Why is no real title available?)
• scientific article; zbMATH DE number 3335016 (Why is no real title available?)
• Computable stack functions for semantics of stack programs
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• General iteration and unary functions
• ITERATION AND RECURSION
• Iterative Characterizations of Computable Unary Functions: A General Method
• Primitive iteration and unary functions
• Primitive recursive functions
• Sequence recursiveness without cylindrification and limited register machines
• Sequence-to-sequence recursiveness

Cited in

(5)

• Iteration on notation and unary functions
• Iterative Characterizations of Computable Unary Functions: A General Method
• Primitive iteration and unary functions
• Definitional schemes for primitive recursive and computable functions
• Bounded iteration and unary functions

This page was built for publication: Succinct iterative characterizations of primitive computable unary functions

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