The complexity of universal text-learners

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

Volumn 1279, Issue , 1997, Pages 441-451

  Stephan, Frank C ^a   Terwijn, Sebastiaan A ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

INCLUSION PROBLEM; LANGUAGE LEARNING; TURING DEGREES; UPPER BOUND;

COMPUTATIONAL LINGUISTICS;

EID: 84958740169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036205     Document Type: Conference Paper

References (21)

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. Ganesh Baliga, John Case and Sanjay Jain (1996): Synthesizing Enumeration Techniques for Language Learning. Proceedings of the Ninth Conference on Computar tional Learning Theory (COLT) 169-180.
4. Janis Barzdins and Kariis Podnieks (1973): The Theory of Inductive Inference. Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS) 9-15.
5. Leonard Blum and Manuel Blum (1975): Towards a Mathematical Theory of Inductive Inference. Information and Control 28:125-155.
6. 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.
7. Rusins Freivalda and Rolf Wiehagen (1979): Inductive inference with additional information. Elektronische Informationsverarbeitung und Kybemetik 15:179-185.
8. 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.
9. Mark Gold (1967): Language Identification in the Limit. Information and Control 10:447-474.
10. Sanjay Jain and Arun Sharma (1993): Learning with the Knowledge of an Upper Bound on Program Size. Information and Computation 102:118-166.
11. Sanjay Jain and Arun Sharma (1993): On the non-existence of maximal inference degrees for language identification. Information Processing Letters 47:81-88.
12. Klaus-Peter Jantke (1979): Natural properties of strategies identifying recursive functions. Elektronische Informationsverarbeitung und Kybemetik 15:487-496.
13. Shyam Kapur and Gianfranco Bilardi (1992): On uniform leamability of language families. Information Processing Letters 44:35-38.
14. Susanne Kaufmann and Frank Stephan (1997): Robust Learning with Infinite Additional Information. To appear at EuroCOLT 1997. Long version is available as: Forschungsberichte Mathematische Logjk 23 / 1996 des Mathematischen Institut an der Universität Heidelberg, Heidelberg, 1996.
15. Hartley Rogers, Jr. (1967): Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York.
16. Piergiorgio Odifreddi (1989): Classical Recursion Theory. North-Holland.
17. Daniel Osherson, Dick de Jongh, Eric Martin and Scott Weinstein (1997): Formal learning theory, in Handbook of Logic and Language, edited by J. van Benthem and A. ter Meulen. Elsevier, pp. 737-775.
18. Daniel Osherson, Michael Stob and Scott Weinstein (1986): Systems that Learn. Bradford - The MIT Press, Cambridge, Massachusetts.
19. Daniel Osherson, Michael Stob and Scott Weinstein (1988): Synthesizing inductive expertise, Information and Computation 77(2):138-161.
20. Daniel Osherson, Michael Stob and Scott Weinstein (1991): A Universal Inductive Inference Machine. Journal of Symbolic Logic 56:661-672.
21. Robert Soare (1987): Recursively Enumerable Sets and Degrees. Springer-Verlag Heidelberg.