Robust learning with infinite additional information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1208, Issue , 1997, Pages 316-330

  Kaufmann, Susanne ^a   Stephan, Frank ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATION THEORY; RECURSIVE FUNCTIONS;

ALGORITHMIC LEARNING; FURTHER WORKS; INPUT-OUTPUT; ROBUST LEARNING; TURING DEGREES;

LEARNING ALGORITHMS;

EID: 84949191307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62685-9_26     Document Type: Conference Paper

References (29)

1. Lenny Adleman and Manuel Blum (1991): Inductive Inference and Unsolvability. Journal of Symbolic Logic 56:891-900.
2. Dana Angluin (1980): Inductive Inference of Formal Languages from Positive Data. Information and Control 45:117-135.
3. Dana Angluin (1987): Learning Regular Sets From Queries and Counterexamples. Information and Computation 75:87-106.
4. Ganesh Baliga and John Case (1994): Learning with Higher Order Additional Information. Proceedings of the Fifth Workshop on Algorithmic Learning Theory (ALT) 64-75.
5. Janis Barzdins (1971): Prognostication of automata and functions. Information Processing '71 (1) 81-84. Edited by C. P. Freiman, North-Holland, Amsterdam.
6. Shai Ben-David (1992): Can Finite Samples Detect Singularities of Real-Valued Functions? Proceedings of the 24th Annual ACM Symposium on the Theory of Computer Science, Victoria, B.C., 390-399.
7. Leonard Blum and Manuel Blum (1975): Towards a Mathematical Theory of Inductive Inference. Information and Control 28:125-155.
8. John Case, Sanjay Jain and Aran Sharma (1992): On learning limiting programs. International Journal of Foundations of Computer Science 1:93-115.
9. John Case, Susanne Kaufmann, Efim Kinber and Martin Kummer (1995): Learning Recursive Functions From Approximations. Proceedings of the second European Conference on Computational Learning Theory (EuroCOLT) 140-153.
10. Lance Fortnow, William Gasarch, Sanjay Jain, Efim Kinber, Martin Kummer, Steven Kurtz, Mark Pleszkoch, Theodore Slaman, Robert Solovay and Frank Stephan (1994): Extremes in the Degrees of Inferability. Annals of Pure and Applied Logic 66:231-276.
11. Rusins Freivalds and Rolf Wiehagen (1979): Inductive inference with additional information. Elektronische Informationsverarbeitung und Kybernetik 15:179-185.
12. William Gasarch and Mark Pleszkoch (1989): Learning via queries to an oracle. Proceedings of the Second Annual Conference on Computational Learning Theory (COLT) 214-229.
13. Mark Gold (1967): Language Identification in the Limit. Information and Control 10:447-474.
14. Sanjay Jain and Arun Sharma (1991): Learning in the Presence of Partial Explanations. Information and Computation 95:162-191.
15. Sanjay Jain and Arun Sharma (1993): Learning with the Knowledge of an Upper Bound on Program Size. Information and Computation 102:118-166.
16. Klaus-Peter Jantke (1991): Monotonic and Non-Monotonic Inductive Inference. New Generation Computing 8:349-360.
17. Carl Jockusch (1972): Degrees in which recursive sets are uniformly recursive. Canadian Journal of Mathematics, 24:1092-1099.
18. Susanne Kaufmann and Frank Stephan (1996): Robust Learning with Infinite Additional Information (long version of this paper). Forschungesberichte Mathema-tische Logik 26 / 1996 des Mathematischen Institut an der Universität Heidelberg, Heidelberg, 1996.
19. Martin Kummer and Frank Stephan (1993): On the Structure of Degrees of Inferability. Proceedings of the Sixth Conference on Computational Learning Theory (COLT) 117-126.
20. Wolfgang Merkle and Frank Stephan (1996): Trees and Learning. Proceedings of the Ninth Conference on Computational Learning Theory (COLT) ACM-Press, pp. 270-279.
21. Hartley Rogers, Jr. (1967): Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York.
22. Piergiorgio Odifreddi (1989): Classical Recursion Theory. North-Holland.
23. Daniel Osherson, Michael Stob and Scott Weinstein (1986): Systems that Learn. Bradford-The MIT Press, Cambridge, Massachusetts.
24. Daniel Osherson, Michael Stob and Scott Weinstein (1988): Synthesizing inductive expertise, Information and Computation 77(2):138-161.
25. Claus Peter Schnorr (1971): Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1971.
26. Theodore Slaman and Robert Solovay (1991): When Oracles Do Not Help. Proceedings of the Fourth Conference on Computational Learning Theory (COLT) 379-383.
27. Robert Soare (1987): Recursively Enumerable Sets and Degrees. Springer-Verlag Heidelberg.
28. Frank Stephan (1996): On One-Sided Versus Two-Sided Classification. Forschungs-berichte Mathematische Logik 25 / 1996, Mathematisches Institut, Universität Heidelberg.
29. Thomas Zeugmann (1993): Algorithmisches Lernen von Funktionen und Sprachen. Habilitationsschrift an der Technischen Hochschule Darmstadt.