Preview
Unable to display preview. Download preview PDF.
Bibliography
Rose G.F. Ullian J.S., Approximation of functions on the integers. Pacific Journal of Mathematics, 13 (1963)
Tsichritzis D., Approximation and complexity of functions on the in tegers. Information Sciences, 3, 1 (1971)
Lynch N., Recursive approximations to the halting problem. JCSS (1974)
Gold E.M., Limiting Recursion J.S.L., 30, 1 (1965)
Schubert L.K., Iterated limitng recursion and the program minimization problem. J.ACM, 21, 3 (1974)
Criscuolo G., Minicozzi E. and Tratteur G., Limiting recursion and the arithmetic hierarchy. Revue AIRO, 9 (1975)
Rabin M.O., Theoretical impediments to artificial intelligence. IFIP Congress (1974)
Ausiello G., Relations between complexity and semantics of recursive programs. II Symposium on Automata, languages and programming (1974)
Rogers H.Jr., Theory of recursive functions and effective computability. Mc Graw-Hill (1967)
Author information
Authors and Affiliations
Editor information
Rights 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