SpringerLink
Log in

On the comparison of notions of approximation

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

  • 1872 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.

Bibliography

  1. Rose G.F. Ullian J.S., Approximation of functions on the integers. Pacific Journal of Mathematics, 13 (1963)

    Google Scholar 

  2. Tsichritzis D., Approximation and complexity of functions on the in tegers. Information Sciences, 3, 1 (1971)

    Google Scholar 

  3. Lynch N., Recursive approximations to the halting problem. JCSS (1974)

    Google Scholar 

  4. Gold E.M., Limiting Recursion J.S.L., 30, 1 (1965)

    Article  Google Scholar 

  5. Schubert L.K., Iterated limitng recursion and the program minimization problem. J.ACM, 21, 3 (1974)

    Article  Google Scholar 

  6. Criscuolo G., Minicozzi E. and Tratteur G., Limiting recursion and the arithmetic hierarchy. Revue AIRO, 9 (1975)

    Google Scholar 

  7. Rabin M.O., Theoretical impediments to artificial intelligence. IFIP Congress (1974)

    Google Scholar 

  8. Ausiello G., Relations between complexity and semantics of recursive programs. II Symposium on Automata, languages and programming (1974)

    Google Scholar 

  9. Rogers H.Jr., Theory of recursive functions and effective computability. Mc Graw-Hill (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, Università di Roma, Italia

    Giorgio Ausiello

  2. Istituto di Matematica — Università di Roma, Italia

    Marco Protasi

Authors
  1. Giorgio Ausiello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Protasi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ausiello, G., Protasi, M. (1975). On the comparison of notions of approximation. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_192

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_192

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation