The Equivalence Problem of Simple Programs
From MaRDI portal
Publication:5609377
DOI10.1145/321607.321621zbMath0209.02001MaRDI 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
03D99: Computability and recursion theory
Related Items
Some Hierarchies of Primitive Recursive Functions on Term Algebras, ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS, Simple programming languages and restricted classes of Turing machines, 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, Function iteration logics and flowchart schemata, Toward a mathematical theory of graph-generative systems and its applications, Linear programs in a simple reversible language., A note on comparison of subrecursive hierarchies, A note on the complexity of program evaluation, Unnamed Item