Skip to main content
SpringerLink
Log in

Nondeterministic finite algorithmic procedures as the models of abstract computability

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 278))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Moldestad, J.;Stoltenberg-Hausen, V.;Tucker, J. Finite algorithmic procedures and computation theories. Math.Scand. 46(1980), 77–94.

    Google Scholar 

  2. Fenstad, J. General Recursion Theory. Springer — Varlag, Berlin, 1980.

    Google Scholar 

  3. Coustable, R.G.;Gries, D. On classes of program schemata,SIAM. Comput. 1(1972), 66–118.

    Google Scholar 

  4. Ershov,A.P.;Lyapunov,A.A. On formalization of conception of programm.Cybernetics, 1967, no.5, 40–57.

    Google Scholar 

  5. Soloviev,V.D. The structure of close classes of computable functions and predicates. Izvastia vuzov.Matematika. 1982, no.12, 51–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan State University, 420008, Kazan, USSR

    V. D. Soloviev

Authors
  1. V. D. Soloviev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach Rais Gatič Bukharajev Oleg Borisovič Lupanov

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Soloviev, V.D. (1987). Nondeterministic finite algorithmic procedures as the models of abstract computability. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-18740-5_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18740-0

  • Online ISBN: 978-3-540-48138-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation