Refinements of inductive inference by Popperian and reliable machines

Restricted and unrestricted algorithmic devices which attempt to arrive in the limit at explanatory computer programs for input functions are studied. The input functions may be interpreted as summaries of the behavior of real world phenomena. A classification of criteria of success for such devices is made based on Karl Popper's refutability principle in philosophy of science. Also considered are criteria of success requiring reliability in the sense that the devices should not mislead us by converging to faulty programs. The criteria in the classifications are compared to one another and some interesting tradeoff results are obtained. The techniques of recursive function theory are employed.

[1]  James S. Royer.  A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.

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

[3]  Thomas Zeugmann,et al.  A-posteriori Characterizations in Inductive Inference of Recursive Functions , 1983, J. Inf. Process. Cybern..

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

[5]  Karlis Podnieks.  Comparing various concepts of function prediction. Part 1. , 1974 .

[6]  J. M. Barzdin,et al.  Prognostication of Automata and Functions , 1971, IFIP Congress.

[7]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

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

[9]  Mark A. Fulk,et al.  Saving the Phenomena: Requirements that Inductive Inference Machines Not Contradict Known Data , 1988, Inf. Comput..

[10]  Mark A. Fulk.  A study of inductive inference machines , 1986 .

[11]  Gregory A. Riccardi.  The Independence of Control Structures in Abstract Programming Systems , 1981, J. Comput. Syst. Sci..

[12]  John Case,et al.  Strong Separation of Learning Classes , 1992, AII.

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

[14]  Eliana Minicozzi,et al.  Some Natural Properties of Strong-Identification in Inductive Inference , 1976, Theor. Comput. Sci..

[15]  Robert P. Daley.  Inductive inference hierarchies: probabilistic vs pluralistic strategies , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[16]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[17]  Yves Marcoux.  Composition is almost as good as s-1-1 , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[18]  Carl H. Smith,et al.  Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..

[19]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[20]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

[21]  Robert P. Daley.  On the Error Correcting Power of Pluralism in BC-Type Inductive Inference , 1983, Theoretical Computer Science.

[22]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

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