Succinct iterative characterizations of primitive computable unary functions

DOI10.1016/0020-0190(95)00167-0zbMath0875.68273OpenAlexW2069175391MaRDI QIDQ672834

Stefano 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)

Related Items (1)

Iteration on notation and unary functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive iteration and unary functions
• Computable stack functions for semantics of stack programs
• Sequence recursiveness without cylindrification and limited register machines
• General iteration and unary functions
• Sequence-to-sequence recursiveness
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• Iterative Characterizations of Computable Unary Functions: A General Method
• ITERATION AND RECURSION
• Primitive recursive functions

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