Equivalence of partial recursivity and computability by algorithms without concluding formulas

DOI10.1007/BF02575518zbMath0242.02043OpenAlexW1988771156MaRDI QIDQ2553960

Giorgio 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

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

Related Items

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