The Equivalence Problem of Simple Programs

DOI10.1145/321607.321621zbMath0209.02001OpenAlexW1988826480MaRDI QIDQ5609377

No author found.

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321607.321621

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Related Items (12)

Unnamed Item ⋮ Linear programs in a simple reversible language. ⋮ Some Hierarchies of Primitive Recursive Functions on Term Algebras ⋮ Some simplified undecidable and NP-hard problems for simple programs ⋮ On the complexity of simple arithmetic expressions ⋮ On the zero-inequivalence problem for loop programs ⋮ A note on the complexity of program evaluation ⋮ ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS ⋮ Function iteration logics and flowchart schemata ⋮ Toward a mathematical theory of graph-generative systems and its applications ⋮ A note on comparison of subrecursive hierarchies ⋮ Simple programming languages and restricted classes of Turing machines

This page was built for publication: The Equivalence Problem of Simple Programs