Skip to main content
SpringerLink
Log in

The problem of equivalence in the class of φ-complexes

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatigz, Moscow, 1960.

    Google Scholar 

  2. E. L. Yushchenko, Address Programming [in Russian], Gostekhizdat, UkrSSR, Kiev, 1963.

    Google Scholar 

  3. V. I. Malinovskii, “The problem of equivalence in a class of address algorithms,” Kibernetika, Vol. 4, No. 5, 1968.

Download references

Authors
  1. V. I. Malinovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, Vol. 5, No. 2, pp. 28–34, March–April, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Malinovskii, V.I. The problem of equivalence in the class of φ-complexes. Cybern Syst Anal 5, 155–162 (1969). https://doi.org/10.1007/BF01071085

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation