Skip to main content
SpringerLink
Log in

Alphabet operators and algorithms

  • 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

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

References

  1. A. M. Turing, “Computable numbers with an application to Entscheidungsproblem,”Proc. Lond. Math. Soc.,42, 230–262 (1936);43, 544–546 (1937).

    Google Scholar 

  2. A. N. Kolmogorov and V. A. Uspenskii, “Toward the definition of algorithm,”Usp. Mat. Nauk,13, No. 4(82), 3–28 (1958).

    Google Scholar 

  3. Yu. M. Borodyanskii, “Nonalgorithmic discrete procedures,”Kibern. Sist. Anal., No. 2 (1992).

  4. M. S. Burgin, “Inductive Turing machines,”Dokl. Akad. Nauk SSSR,270, No. 6, 1289–1293 (1983).

    Google Scholar 

  5. M. S. Burgin, “Inductive Turing machines with a multiple head and Kolmogorov algorithms,”Dokl. Akad. Nauk SSSR,275, No. 2, 280–284 (1984).

    Google Scholar 

  6. A. A. Markov, “On completeness of the classical predicate calculus in constructive mathematical logic,”Dokl. Akad. Nauk SSSR,215, No. 2, 266–269 (1974).

    Google Scholar 

  7. E. M. Gold, “Gold limiting recursion,”J. Symbol. Logic,30, No. 1, 28–48 (1965).

    Google Scholar 

  8. H. Putnam, “Trial and error predicates and the solution to a problem of Mostowski,”J. Symbol. Logic,30, No. 1, 49–57 (1965).

    Google Scholar 

  9. B. A. Trakhtenbrot and Ya. M. Barzdyn’,Finite Automata [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  10. A. A. Markov, “Theory of algorithms,”Tr. Mat. Inst. Akad. Nauk SSSR,42 (1954).

  11. J. L. Kelley, General Topology [Russian translation], Nauka, Moscow (1968).

    Google Scholar 

  12. M. S. Burgin, “Algorithms and algorithmic problems,”Programmirovanie, No. 4, 3–14 (1985).

    Google Scholar 

  13. M. S. Burgin, “Functional equivalence of operators and parallel computation processes,”Programmirovanie, No. 6, 3–10 (1980).

    Google Scholar 

  14. M. S. Burgin, “Functor semantics in categories of named sets,” in:Rationality, Reasoning, Communication [in Russian], Naukova Dumka, Kiev (1987), pp. 183–198.

    Google Scholar 

  15. Yu. M. Borodyanskii and S. S. Gorokhovskii, “An approach to the definition of complexity of algorithms,” in:Heuristics and Artificial Intelligence [in Russian], No. 1, 22–24 (1969).

  16. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  17. C. Kuratowski and A. Mostowski,Theory of Sets [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  18. V. M. Glushkov,Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  19. M. S. Burgin, “Arithmetic hierarchy and inductive Turing machines,”Dokl. Akad. Nauk SSSR,288, No. 3, 530–533 (1988).

    Google Scholar 

  20. M. S. Burgin and Yu. M. Borodyanskii, “Infinite processes and superrecursive algorithms,”Dokl. Akad. Nauk SSSR,321, No. 5, 876–879 (1991).

    Google Scholar 

  21. H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

Download references

Authors
  1. Yu. M. Borodyanskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. S. Burgin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 42–57, May–June, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borodyanskii, Y.M., Burgin, M.S. Alphabet operators and algorithms. Cybern Syst Anal 29, 338–349 (1993). https://doi.org/10.1007/BF01125539

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation