Skip to main content
SpringerLink
Log in

Unsolvability of some algorithmic problems for straight-line programs

  • Published:
Cybernetics Aims and scope

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. O. H. Ibarra and B. S. Leininger, “On the simplification and equivalence problems for straight-line programs,” J. ACM,30, No. 3, 641–656 (1983).

    Google Scholar 

  2. O. H. Ibarra and B. S. Leininger, “Straight-line programs with one input variable,” SIAM J. Comput.,11, No. 1, 1–15 (1982).

    Google Scholar 

  3. Yu. V. Matiyasevich, “Diophantine sets,” Usp. Mat. Nauk,22, No. 5, 185–222 (1972).

    Google Scholar 

  4. Y. Matijasevic (Matiyasevich) and J. Robinson, “Reduction of an arbitrary Diophantine equation to one in 13 unknowns,” Acta Arithm.,27, 521–553 (1975).

    Google Scholar 

Download references

Authors
  1. D. V. Shiryaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 63–66, January–February, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shiryaev, D.V. Unsolvability of some algorithmic problems for straight-line programs. Cybern Syst Anal 25, 78–82 (1989). https://doi.org/10.1007/BF01074887

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01074887

Keywords

Search

Navigation