Abstract
Based on limiting recursive function proposed by Gold [2], learnable algorithm on the continuum are defined. We discuss the class of learnable real numbers and learnable real sequence in various ways. In this paper we summarize some attempts to classify the learnably approximable real numbers by the convergence rates of the corresponding computable(or learnable) sequences of rational numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. Journal of complexity 16, 676–690 (2000)
Gold, E.M.: Limiting recursive. Journal of symolic logic 30, 28–48 (1965)
Hayashi, S., Nakata, K.: Towards limit computable mathematics. In: Callaghan, P., et al. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 125–144. Springer, Heidelberg (2002)
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)
Yasugi, M., et al.: Computability aspects of some discontinuous functions. SCMJ 5 (2001)
Zheng, X.: Recursive approximability of real numbers. Math. Log. Quart., 473–485 (2002)
Li, Z., Yasugi, M.: Computability of continuous and discontinuous real recursive functions. Lecture Series on Computer and Computational Sciences (LECCS 2006) (To appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Li, X. (2007). Learnable Algorithm on the Continuum. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)