Skip to main content
Log in

Decidability problems for meta-R-functions

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

Access this article

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

Instant access to the full article PDF.

References

  1. L. P. Lisovik, “Algorithmic topics forR-functions,” Kibernetika, No. 1, 12–17 (1987).

    MATH  MathSciNet  Google Scholar 

  2. L. P. Lisovik, “Operations onR-numbers,” Kibernetika, No. 2, 1–7 (1990).

    MATH  Google Scholar 

  3. B. A. Kushner, Lectures in Constructive Mathematical Analysis [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  4. L. P. Lisovik, “On the equivalence problem for transformers on Σ-trees with finite-turnaround counters,” Kibernetika, No. 5, 19–24 (1984).

    MATH  MathSciNet  Google Scholar 

  5. A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  6. K. Kuratowski, Topology [Russian translation], Vol. 1, Mir, Moscow (1966).

    Google Scholar 

  7. L. P. Lisovik, “On classes of functions defined by transformers,” Kibernetika, No. 6, 1–7 (1990).

    MATH  Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 13–22, January–February, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P., Drobyshev, P.V. Decidability problems for meta-R-functions. Cybern Syst Anal 31, 8–14 (1995). https://doi.org/10.1007/BF02366790

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation