Skip to main content

Prediction of Recursive Real-Valued Functions from Finite Examples

  • Conference paper
  • First Online:
Book cover New Frontiers in Artificial Intelligence (JSAI 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4012))

Included in the following conference series:

Abstract

In this paper, we investigate prediction of recursive real-valued functions from finite examples by extending the framework of inductive inference of recursive real-valued functions to be a more realistic one. First, we propose a finite prediction machine, which is a procedure that requests finite examples of a recursive real-valued function h and a datum of a real number x, and that outputs a datum of h(x). Then, we formulate finite prediction of recursive real-valued functions and investigate the power of it. Furthermore, for a fixed rational closed interval I, we show that the class of all finitely predictable sets of recursive real-valued functions coincides with the class of all inferable sets of recursive real-valued functions in the limit, that is, \({\sc RealFP}_{\emph I}={\sc RealEx}_{\emph I}\).

This work is partially supported by Grand-in-Aid for Scientific Research 15700137 and 16500084 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apsītis, K., Arikawa, S., Freivalds, R., Hirowatari, E., Smith, C.H.: On the inductive inference of recursive real-valued functions. Theoret. Comput. Sci. 219, 3–17 (1999)

    Article  MathSciNet  Google Scholar 

  2. J. M. Bārzdiņš, Freivalds, R.V.: On the prediction of general recursive functions. Soviet Mathematics Doklady 13, 1224–1228 (1972)

    Google Scholar 

  3. Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoret. Comput. Sci. 25, 193–220 (1983)

    Article  MathSciNet  Google Scholar 

  4. Cooper, S.B., Löwe, B., Torenvliet, L. (eds.): CiE 2005. LNCS, vol. 3526. Springer, Heidelberg (2005)

    Google Scholar 

  5. Gold, E.M.: Language identification in the limit. Inform. Control 10, 447–474 (1967)

    Article  MathSciNet  Google Scholar 

  6. Grubba, T., Hertling, P., Tsuiki, H., Weihrauch, K. (eds.): Proc. 2nd International Conference on Computability and Complexity in Analysis (2005)

    Google Scholar 

  7. Hayashi, S.: Mathematics based on learning. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 7–21. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Hirowatari, E., Arikawa, S.: Inferability of recursive real-valued functions. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol. 1316, pp. 18–31. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Hirowatari, E., Arikawa, S.: A comparison of identification criteria for inductive inference of recursive real-valued functions. Theoret. Comput. Sci. 268, 351–366 (2001)

    Article  MathSciNet  Google Scholar 

  10. Hirowatari, E., Hirata, K., Miyahara, T., Arikawa, S.: Criteria for inductive inference with mind changes and anomalies of recursive real-valued functions. IEICE Trans. Inf. Syt. E86-D, 219–227 (2003)

    Google Scholar 

  11. Hirowatari, E., Hirata, K., Miyahara, T., Arikawa, S.: Refutability and reliability for inductive inference on recursive real-valued functions. IPSJ Trans. Mathematical Modeling and Its Applications 46, 1–11 (2005)

    Google Scholar 

  12. Hirowatari, E., Hirata, K., Miyahara, T., Arikawa, S.: On the prediction of recursive real-valued functions. In: Proc. Computability in Europe 2005, ILLC Publications, University van Amsterdam, pp. 93–103 (2005)

    Google Scholar 

  13. Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that learn: An introduction to learning theory, 2nd edn. The MIT Press, Cambridge (1999)

    Book  Google Scholar 

  14. Ko, K.: Complexity theory of real functions, Birkhäuser (1991)

    Google Scholar 

  15. Martin, É., Sharma, A., Stephan, F.: On ordinal VC-dimension and some notions of complexity. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol. 2842, pp. 54–68. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Pour-El, M.B., Richards, J.I.: Computability in analysis and physics. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  17. Niijima, K., Uchida, H., Hirowatari, E., Arikawa, S.: Discovery of differential equations from numerical data. In: Arikawa, S., Motoda, H. (eds.) DS 1998. LNCS (LNAI), vol. 1532, pp. 364–374. Springer, Heidelberg (1998)

    Google Scholar 

  18. Turing, A.M.: On computable numbers, with the application to the Entscheidungsproblem. Proc. London Mathematical Society 42, 230–265 (1936)

    MathSciNet  MATH  Google Scholar 

  19. Weihrauch, K.: Computable analysis – An introduction. Springer, Heidelberg (2000)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirowatari, E., Hirata, K., Miyahara, T. (2006). Prediction of Recursive Real-Valued Functions from Finite Examples. In: Washio, T., Sakurai, A., Nakajima, K., Takeda, H., Tojo, S., Yokoo, M. (eds) New Frontiers in Artificial Intelligence. JSAI 2005. Lecture Notes in Computer Science(), vol 4012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780496_25

Download citation

  • DOI: https://doi.org/10.1007/11780496_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35470-3

  • Online ISBN: 978-3-540-35471-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics