Skip to main content
SpringerLink
Log in

Functions computable in the limit by probabilistic machines

  • Computing Systems
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

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

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. LEEUW, K. DE; MOORE, E.F.; SHANNON, C.E.; SHAPIRO, N. Computability by probabilistic machines. Automata Studies, Annals of Mathematics Studies, No 34, Princeton U. Press, Princeton, N.J., 1956.

    Google Scholar 

  2. KUSHNER, B.A. Lectures in constructive mathematical analysis (Russian). Nauka, Moscow, 1973.

    Google Scholar 

  3. ROGERS, H. Theory of recursive functions and effective computability. Mc Graw-Hill, New York, 1967.

    Google Scholar 

  4. Barzdin, J.M. On computability by probabilistic machines (Russian). Dokladi AN SSSR 189 (1969), No 4.

    Google Scholar 

  5. ZVONKIN, A.K.; LEVIN, L.A. Complexity of finite objects and basing of the notions of information and randomness by means of the theory of algorithms (Russian). Uspehi matematicheskih nauk 25 (1970), No 6.

    Google Scholar 

  6. PODNIEKS, K.M. On reducibilities of classes of functions (Russian). Uravnenija matematicheskoi fiziki i teorija algoritmov, Latvian State University, Riga, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of Latvian State University, Riga, U.S.S.R.

    R. V. Freivald

Authors
  1. R. V. Freivald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freivald, R.V. (1975). Functions computable in the limit by probabilistic machines. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_671

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_671

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation