Skip to main content

Inductive inference up to immune sets

  • Submitted Papers
  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1989)

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

Included in the following conference series:

  • 165 Accesses

Abstract

We consider approximate in the limit of Gödel numbers for total recursive functions. The set of possible errors is allowed to be infinite but “effectively small”. The latter notion is precise in several ways, as “immune”, “hyperimmune”, “hyperhyperimmune”, “cohesive”, etc. All the identification types considered turn out to the different.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arslanov M.M.Two theorems on recursively enumerable sets. — Algebra i Logika, 1968, v.7, No. 3, p.4–8 (Russian).

    Google Scholar 

  2. Barzdin J.M. Two theorem on the limiting synthesis of functions. Latvii gosudarst. Univ. Ucenye Zapiski, 1974, v.210, p.82–88.

    Google Scholar 

  3. Case J., and Smith C. Anomaly hierarchies of machanized inductive inference. — Proc. 10th STOc, ACM, 1978, p.314–319.

    Google Scholar 

  4. Case J., and Smith C. Comparison of identification criteria for machine inductive inference. — Theoretical Computer Science, 1983, v.25, p.193–220.

    Google Scholar 

  5. Freivald R. On the limit synthesis of numbers of general recursive functions in various computable numerations. — Soviet Math. Doklady, 1974, v.15, No.6, p.1681–1683.

    Google Scholar 

  6. Freivalda R., and Kinber E.B. Criteria of distinction among limit identification types. — “Sintez, testirovanie i otladka programm”. Proc. USSR Nacional Symposium, Riga, 1981, p.128–129 (Russian).

    Google Scholar 

  7. Pitt L. A characterization of probabilistic inference. — of the 25th Annual Symposium on Foundations of Comp.Sc., 1984, p.485–497.

    Google Scholar 

  8. Podnieks K. Computing various concepts of function prediction.Latvii gosudarst. Univ. Ucenye Zapiski, 1974, v.210, p.68–81.

    Google Scholar 

  9. Rogers H.Jr. Theory of recursive Functions and Effective Computability. MIT Press, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freivalds, R., Vīksna, J. (1989). Inductive inference up to immune sets. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-51734-0_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51734-4

  • Online ISBN: 978-3-540-46798-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy