Translating recursion equations into flow charts

DOI10.1016/S0022-0000(71)80036-3zbMath0239.68002OpenAlexW2122330398MaRDI QIDQ2553232

H. R. jun. Strong

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(71)80036-3

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items

Unnamed Item ⋮ The equivalence of r.e. program schemes and data flow schemes ⋮ Program equivalence and context-free grammars ⋮ Function iteration logics and flowchart schemata ⋮ A family of rules for recursion removal ⋮ Effective proper procedures and universal classes of program schemata ⋮ Program transformations and algebraic semantics ⋮ Recursive converters on a memory ⋮ On a class of recursive procedures and equivalent iterative ones ⋮ Feferman on Computability ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems ⋮ Characterization of flowchartable recursions ⋮ Translatability of schemas over restricted interpretations ⋮ On self-modifying programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gödel numberings of partial recursive functions
• Recursion and iteration
• Counter machines and counter languages
• Unsolvability in 3 × 3 Matrices
• Properties of Programs and the First-Order Predicate Calculus