Abstract
In this paper we consider the equivalence problem for several classes of programs. We show that it is unsolvable for all "acceptable" program classes of the Grzegorczyk class ɛ0 and of the polynominals over the integers formed with ∸ instead of -. Furthermore we show that the equivalence problem is solvable for the class L1(∸1) of loop programs with the additional instruction X := X∸1, but again unsolvable for the class L1(∸1, +) and the Cleave-Ritchie-classes
and L 12 (∸1).
Chapter PDF
Literaturverzeichnis
Grzegorczyk, A.: "Some classes of recursive functions", Rozprawy Mathematyczne 4. (1953)
Matijasevič, J.V.: "Enumerable sets are Diophantine", Soviet Math. Dokl. 11, 354–358. (1970)
Meyer, A.R., D.M. Ritchie: "The complexity of loop programs", Proc. 22nd Nat. Conf. ACM, 1967, ACM Pub P-67, pp. 465–469
Presburger, M.: "über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt", Comptesrendus du I Congrès des Mathématiciens des Pays Slaves, Warsaw (1930) pp. 92–101, 395
Tsichritzis, D.: "The equivalence problem of simple programs", Journal of the Association for Computing Machinery 17: 729–738. (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beck, H. (1975). Zur Entscheidbarkeit der funktionalen Äquivalenz. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive