A flow diagram composition of Markov's normal algorithms without concluding formulas

DOI10.1007/BF01951941zbMath0283.68026OpenAlexW2060743687MaRDI QIDQ4769964

Andrea Maggiolo-Schettini, Giorgio Germano

Publication date: 1973

Published in: BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (6)

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 ⋮ Sequence-to-sequence recursiveness ⋮ Closure functions and general iterates as reflectors

Cites Work

• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• Primitive recursive functions

This page was built for publication: A flow diagram composition of Markov's normal algorithms without concluding formulas