Sequence-to-sequence recursiveness

DOI10.1016/0020-0190(75)90050-2zbMath0311.02047MaRDI QIDQ1219273

Andrea Maggiolo-Schettini, Giorgio Germano

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90050-2

Mathematics Subject Classification ID

03D20: Recursive functions and relations, subrecursive hierarchies

68N01: General topics in the theory of software

03D99: Computability and recursion theory

18B20: Categories of machines, automata

Related Items

Succinct iterative characterizations of primitive computable unary functions, 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, Unnamed Item, Unnamed Item

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revised report on the algorithmic language ALGOL 60
• Proving a compiler correct: A simple approach
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• ITERATION AND RECURSION