Unsolvability of some algorithmic problems for straight-line programs

We show that the problems of one-equivalence, equivalence, and simplification are undecidable for two classes of straight-line programs with a limited set of simple operations and a limited number of input and local variables.Translated from Kibernetika, No. 1, pp. 63–66, January–February, 1989.