Inductive inference hierarchies: Probabilistic VS pluralistic strategies
In this paper we will briefly survey the developments in hiearchy results in recursion theoretic inductive inference, especially with respect to trading off one feature of the inference process against another, and present some new results regarding trade-offs between probabilistic and pluralistic strategies.
Unable to display preview. Download preview PDF.
- 1).Angluin, D. and Smith, C., A survey of inductive inference: theory and methods, Computing Surveys 15 (1983), 237–269.Google Scholar
- 2).Case, J. and Ngo Manguelle, S., Refinements of inductive inference by poperian machines, Technical Report, SUNY Buffalo, Computer Science Dept., (1979)., Google Scholar
- 3).Case, J. and Smith, C., Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983), 193–220.Google Scholar
- 4).Daley, R., On the error correcting power of pluralism in BC-type inductive inference, Theoretical Computer Science 24 (1983), 95–104.Google Scholar
- 5).Pitt, L., A characterization of probabilistic inference, Proceedings of FOCS Symposium (1984), 485–494., Google Scholar
- 6).Podniecks, K., Comparing various concepts of function prediction, Lecture Notes, Latvian State University (1974), 68–81., Google Scholar
- 7).Smith, C., The power of pluralism for automatic program synthesis, Journal ACM 29 1144–1165.Google Scholar
- 8).Wiehagen, R., Freivalds, R., and Kinber, E., On the power of probabilistic strategies in inductive inference, Theoretical Computer Science 28 (1984), 111–133.Google Scholar