Skip to main content
SpringerLink
Log in

Criteria for the algorithmic completeness of the systems of operations

  • Conference paper
  • First Online:
International Symposium on Theoretical Programming

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

  • 1963 Accesses

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zakharov, D.A., Recursive Functions, A special course for students of the Novosibirsk State University, Novosibirsk, 1970.

    Google Scholar 

  2. Lavrov, I.A., The Use of Arithmetic Progressions of k-th Order For Building Basis of Algebra of Primitive-Recursive Functions, Doklady AN SSSR, v. 172, N 2, 1967, pp. 279–282.

    Google Scholar 

  3. Polyakov, E.A., Algebras of Recursive Functions, Algebra and Logika, Collection of papers of the Institute of Mathematics of the Sib.Br. of the USSR Acad. Sci., v. 3, publ. 1, 1964, pp. 41–56.

    Google Scholar 

  4. Ershov, A.P., Operator Algorithms 1, Problemy Kibernetiki, 3, 1960, pp. 5–48.

    Google Scholar 

  5. Peter, R., Graphschemata und rekursive Funktionen, Dialectica, 12, 1958, pp. 373–388.

    Google Scholar 

  6. Kaphengst, H., Eine abstrakte programmgesteuerte Rechenmaschine, Zeit. Math. Logik und Grund. d. Math., 5, 1959, pp. 366–379.

    Google Scholar 

  7. Sheperdson, J.C. and Sturgis, H.E., Computability of Recursive Functions, Journal of the ACM, v. 10, N 2, 1963, pp. 217–255.

    Google Scholar 

  8. Zaslavsky, I.D., Graph Schemes with Memory, Trudy Math. Instituta AN SSSR, 72, 1964, pp. 99–192.

    Google Scholar 

  9. Ershov, A.P. and Liapounov, A.A., On the Formalization for the Notion of Program, Kibernetika, 5, 1967, pp. 40–57.

    Google Scholar 

  10. Nepomniaschy, V.A., Conditions for the Algorithmic Completeness of the Systems of Operations, Preprints IFIP Congress 71, TA–2, 7–11, 1971.

    Google Scholar 

  11. Nepomniaschy, V.A., On Completeness of the Systems of Operations, Doklady AN SSSR, 199, N 4, 1971, pp. 780–782.

    Google Scholar 

  12. Buchberger, B., A Basic Problem in the Theory of Programming Language, Institut für Numer. Math. und Elektron. Information, Universität Insbruck, Bericht N 72-1, Febr. 1972.

    Google Scholar 

  13. Manna, Z., The Correctness of Programs, Journal of Computer and System Sciences, 3, N 2, 1969, pp. 119–127.

    Google Scholar 

  14. Kaluzhnin, L.A., On the Algorithmization for the Mathematical Problems, Problemy Kibernetiki, 2, 1959, pp. 51–67.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk

    V. A. Nepomniaschy

Authors
  1. V. A. Nepomniaschy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Ershov Valery A. Nepomniaschy

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nepomniaschy, V.A. (1974). Criteria for the algorithmic completeness of the systems of operations. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-06720-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06720-7

  • Online ISBN: 978-3-540-38012-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation