论文信息 - Aggregating Inductive Expertise

Aggregating Inductive Expertise

The aggregation problem is to design an inferential agent that makes intelligent use of the theories offered by a team of inductive inference machines working in a common environment. The present paper formulates several versions of the aggregation problem and investigates them from a recursion theoretic point of view.

Daniel N. Osherson | Michael Stob | Scott Weinstein

[1] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[2] Paul Young,et al. An introduction to the general theory of algorithms , 1978 .

[3] Kenneth Wexler,et al. Formal Principles of Language Acquisition , 1980 .

[4] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.

[5] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[6] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[7] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[8] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[9] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..