Self‐learning inductive inference machines

Self‐knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self‐knowledge. The question is answered affirmatively. Self‐learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.

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

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

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

[4]  Rolf Wiehagen.  Limes-Erkennung rekursiver Funktionen durch spezielle Strategien , 1975, J. Inf. Process. Cybern..

[5]  James S. Royer,et al.  Inductive Inference of Approximations , 1986, Inf. Control..

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

[7]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[8]  Carl H. Smith,et al.  Learning via queries , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[10]  Mahendran Velauthapillai,et al.  On the Inference of Approximate Programs , 1990, Theor. Comput. Sci..

[11]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[12]  Carl H. Smith,et al.  On the role of search for learning , 1989, COLT '89.

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

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

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

[16]  Carl H. Smith,et al.  Trade-Off among Parameters Effecting Inductive Inference , 1989, Inf. Comput..

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

[18]  Richard Reviewer-Granger.  Unified Theories of Cognition , 1991, Journal of Cognitive Neuroscience.

[19]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[20]  John Case,et al.  Machine Inductive Inference and Language Identification , 1982, ICALP.

[21]  Mark A. Fulk.  Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

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

[23]  Douglas B. Lenat,et al.  EURISKO: A Program That Learns New Heuristics and Domain Concepts , 1983, Artif. Intell..

[24]  Carl H. Smith,et al.  Training Sequences , 1989, Theor. Comput. Sci..

[25]  N. J. Cappelørn,et al.  An Apology , 2020, Mental health.

[26]  Donald Perlis,et al.  Languages with Self-Reference II: Knowledge, Belief, and Modality , 1988, Artif. Intell..

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

[28]  Donald Perlis,et al.  Languages With Self-Reference I: Foundations , 1985, Artif. Intell..

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

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