On the comparison of notions of approximation

  • Giorgio Ausiello
  • Marco Protasi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Characteristic Function Local Approximation Turing Machine Recursive Function Computable Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rose G.F. Ullian J.S., Approximation of functions on the integers. Pacific Journal of Mathematics, 13 (1963)Google Scholar
  2. 2.
    Tsichritzis D., Approximation and complexity of functions on the in tegers. Information Sciences, 3, 1 (1971)Google Scholar
  3. 3.
    Lynch N., Recursive approximations to the halting problem. JCSS (1974)Google Scholar
  4. 4.
    Gold E.M., Limiting Recursion J.S.L., 30, 1 (1965)CrossRefGoogle Scholar
  5. 5.
    Schubert L.K., Iterated limitng recursion and the program minimization problem. J.ACM, 21, 3 (1974)CrossRefGoogle Scholar
  6. 6.
    Criscuolo G., Minicozzi E. and Tratteur G., Limiting recursion and the arithmetic hierarchy. Revue AIRO, 9 (1975)Google Scholar
  7. 7.
    Rabin M.O., Theoretical impediments to artificial intelligence. IFIP Congress (1974)Google Scholar
  8. 8.
    Ausiello G., Relations between complexity and semantics of recursive programs. II Symposium on Automata, languages and programming (1974)Google Scholar
  9. 9.
    Rogers H.Jr., Theory of recursive functions and effective computability. Mc Graw-Hill (1967)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  • Marco Protasi
    • 2
  1. 1.Istituto di AutomaticaUniversità di RomaItalia
  2. 2.Istituto di Matematica — Università di RomaItalia

Personalised recommendations