The Equivalence Problem of Simple Programs

DOI10.1145/321607.321621MaRDI QIDQ5609377zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(12)

• Toward a mathematical theory of graph-generative systems and its applications
• A note on comparison of subrecursive hierarchies
• On the edge of decidability in complexity analysis of loop programs
• 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
• Linear programs in a simple reversible language.
• A note on the complexity of program evaluation
• Some Hierarchies of Primitive Recursive Functions on Term Algebras
• scientific article; zbMATH DE number 3623543 (Why is no real title available?)
• Simple programming languages and restricted classes of Turing machines
• Function iteration logics and flowchart schemata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5609377)