General inductive inference types based on linearly-ordered sets

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

Volumn 1046, Issue , 1996, Pages 243-253

  Ambainis, Andris ^a   Freivalds, Rūsiņš ^a   Smith, Carl H ^b,c  

^a UNIVERSITY OF LATVIA   (Latvia)

^b University of Maryland ^*  (United States)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

INDUCTIVE INFERENCE; LEARNING MACHINES; LINEARLY ORDERED SET; MIND-CHANGES; ORDERED SET;

SET THEORY;

EID: 84948177372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_21     Document Type: Conference Paper

References (18)

1. [Amb95] A. Ambainis. The power of procrastination in inductive inference: how it depends on used ordinal notations, volume 904. Springer-Verlag, 1995. P. Vitányi, editor.
2. [AS83] D. Angluin and C. H. Smith. Inductive inference: Theory and methods. Computing Surveys, 15:237-269, 1983.
3. [Aps94] K. Apsitis, S. Arikawa and K. Jantke, editors. Derived sets and inductive inference, volume 872. Springer-Verlag, 1994.
4. [Chu38] A. Church. The constructive second number class. Bulliten of the AMS, 44:224-232, 1938.
5. [CJS95] J. Case, S. Jain, and M. Suraj, Not-so-nearly-minímal-size program inference. In K. Jantke, editor, Proceedings of the GOSLER Workshop on Algorithmic Learning for Knowledge Processing, to appear 1995. Preliminary version presented November 1993, Dagstuhl Castle, Germany.
6. [CK37] A. Church and S. Kleene. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae, 28:11-21, 1937.
7. [CS83] J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220, 1983.
8. [FS93] R. Freivalds and C. Smith. On the power of procrastination for machine learning. Information and Computation, 107:237-271, 1993.
9. [Gol67] E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
10. [Kle38] S. Kleene. On notation for ordinal numbers. Journal of Symbolic Logic, 3:150-155, 1938.
11. [Erd43] P.Erdos. Some remarks on set theory, Annals of Mathematics(2), vol.44(1943), pp.643-646
12. [FFG95] L. Fortnow, R.Freivalds, W.I.Gasarch, M.Kummer, S.A. Kurtz, C.Smith, F. Stephan. Measure, category and learnng theory. Lecture Notes in Computer Science, vol. 944(1995), pp. 558-569
13. [Fre91] R. Freivalds. Inductive inference of recursive functions: qualitative theory. Lecture Notes in Computer Science, Springer, vol. 502(1991), pp. 77-100
14. [Lis81] L.Lisagor. The Banach-Mazur game. Translated vaersion of Matematiceskij Sbornik, vol. 38(1981), pp. 201-206
15. [Lut92] J. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, vol.44(1992), pp. 226-258
16. [Meh73] K. Mehlhorn. On the size of sets of computable functions, proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973, IEEE Computer Society, pp. 190-196
17. [Rog67] H. Rogers. Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967
18. [Sie34] W. Sierpinski. Sur la dualite entre ka premiere categorie et la mesue nulle, Fundamenta Mathemaicae, vol.22(1934), pp.276-280