Nondeterministic finite algorithmic procedures as the models of abstract computability

  • V. D. Soloviev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Moldestad, J.;Stoltenberg-Hausen, V.;Tucker, J. Finite algorithmic procedures and computation theories. Math.Scand. 46(1980), 77–94.Google Scholar
  2. 2.
    Fenstad, J. General Recursion Theory. Springer — Varlag, Berlin, 1980.Google Scholar
  3. 3.
    Coustable, R.G.;Gries, D. On classes of program schemata,SIAM. Comput. 1(1972), 66–118.Google Scholar
  4. 4.
    Ershov,A.P.;Lyapunov,A.A. On formalization of conception of programm.Cybernetics, 1967, no.5, 40–57.Google Scholar
  5. 5.
    Soloviev,V.D. The structure of close classes of computable functions and predicates. Izvastia vuzov.Matematika. 1982, no.12, 51–56.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • V. D. Soloviev
    • 1
  1. 1.Kazan State UniversityKazanUSSR

Personalised recommendations