# General inductive inference types based on linearly-ordered sets

Conference paper

First Online:

## Abstract

In this paper, we reconsider the definitions of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate the possibility of using arbitrary linearly ordered sets to bound mindchanges in a similar way. It turns out that using certain ordered sets it is possible to define inductive inference types more general than the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.

## Keywords

Maximal Element Recursive Function Inductive Inference Identification Type Duality Principle
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [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.Google Scholar - [AS83]D. Angluin and C. H. Smith. Inductive inference: Theory and methods.
*Computing Surveys*, 15:237–269, 1983.CrossRefGoogle Scholar - [Aps94]K. Apsītis. S. Atikawa and K. Jantke, editors.
*Derived sets and inductive inference*, volume 872. Springer-Verlag, 1994.Google Scholar - [Chu38]A. Church. The constructive second number class.
*Bulliten of the AMS*, 44:224–232, 1938.Google Scholar - [CJS95]J. Case, S. Jain, and M. Suraj, Not-so-nearly-minimal-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.Google Scholar - [CK37]A. Church and S. Kleene. Formal definitions in the theory of ordinal numbers.
*Fundamenta Mathematicae*, 28:11–21, 1937.Google Scholar - [CS83]J. Case and C. Smith. Comparison of identification criteria for machine inductive inference.
*Theoretical Computer Science*, 25(2):193–220, 1983.CrossRefGoogle Scholar - [FS93]R. Freivalds and C. Smith. On the power of procrastination for machine learning.
*Information and Computation*, 107:237–271, 1993.Google Scholar - [Gol67]E. M. Gold. Language identification in the limit.
*Information and Control*, 10:447–474, 1967.CrossRefGoogle Scholar - [Kle38]S. Kleene. On notation for ordinal numbers.
*Journal of Symbolic Logic*, 3:150–155, 1938.Google Scholar - [Erd43]P.Erdos.
*Some remarks on set theory*, Annals of Mathematics(2), vol.44(1943), pp.643–646Google Scholar - [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–569Google Scholar - [Fre91]R. Freivalds.
*Inductive inference of recursive functions: qualitative theory*. Lecture Notes in Computer Science, Springer, vol. 502(1991), pp. 77–100Google Scholar - [Lis81]L.Lisagor.
*The Banach-Mazur game*. Translated vaersion of Matematiceskij Sbornik, vol. 38(1981), pp. 201–206Google Scholar - [Lut92]J. Lutz.
*Almost everywhere high nonuniform complexity*. Journal of Computer and System Sciences, vol.44(1992), pp. 226–258Google Scholar - [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–196Google Scholar - [Rog67]H. Rogers.
*Theory of Recursive Functions and Effective Computability*, McGraw-Hill, 1967Google Scholar - [Sie34]W. Sierpinski.
*Sur la dualite entre ka premiere categorie et la mesue nulle*, Fundamenta Mathemaicae, vol.22(1934), pp.276–280Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1996