Equivalence of partial recursivity and computability by algorithms without concluding formulas

DOI10.1007/BF02575518MaRDI QIDQ2553960zbMATH OpenOpenAlexFDO

Authors G. M. Germano, Andrea Maggiolo-Schettini

Publication date 1972

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02575518

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Recursive functions and relations, subrecursive hierarchies (03D20) Algorithms in computer science (68W99)

Cited in

(8)

• Primitive iteration and unary functions
• Computable stack functions for semantics of stack programs
• Sequence recursiveness without cylindrification and limited register machines
• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• Succinct iterative characterizations of primitive computable unary functions
• Closure functions and general iterates as reflectors

This page was built for publication: Equivalence of partial recursivity and computability by algorithms without concluding formulas

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