Sequence recursiveness without cylindrification and limited register machines

DOI10.1016/0304-3975(81)90071-2zbMath0464.68050OpenAlexW2002737353MaRDI QIDQ1154263

Andrea Maggiolo-Schettini, Giorgio Germano

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90071-2

zbMATH Keywords

theory of computationprogramming languages semanticsrecursive number theory

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Primitive iteration and unary functions, Computable functions in tabular databases, Primitive program algebras of computable functions, General iteration and unary functions, Succinct iterative characterizations of primitive computable unary functions, Closure functions and general iterates as reflectors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable stack functions for semantics of stack programs
• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• Can programming be liberated from the von Neumann style?
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• ITERATION AND RECURSION
• Computability of Recursive Functions