General iteration and unary functions

DOI10.1016/0168-0072(91)90029-LzbMath0747.03018MaRDI QIDQ1182467

Giorgio Germano, Stefano Mazzanti

Publication date: 28 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

partial recursive functionsgeneral computable functionwhile-do iteration operator

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Theory of computing (68Q99)

Related Items (4)

General iteration and unary functions ⋮ Iteration on notation and unary functions ⋮ Succinct iterative characterizations of primitive computable unary functions ⋮ Closure functions and general iterates as reflectors

Cites Work

• Closure functions and general iterates as reflectors
• 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
• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness
• General recursive functions of natural numbers
• Undecidable theories
• Primitive Recursive Functions. II
• A Note on Primitive Recursive Functions
• On folk theorems
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• Recursive Functions of One Variable
• ITERATION AND RECURSION
• Simplifications of the recursion scheme
• A note on recursive functions
• Primitive recursive functions
• Recursion and double recursion
• General Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General iteration and unary functions