论文信息 - How to run algorithmic information theory on a computer: Studying the limits of mathematical reasoning - 字舞流文

How to run algorithmic information theory on a computer: Studying the limits of mathematical reasoning

Lecture given Friday 7 April 1995 at the Santa Fe Institute, Santa Fe, New Mexico. The lecture was videotaped; this is an edited transcript.

Gregory J. Chaitin | G. Chaitin

[1] Gregory J. Chaitin,et al. Information-Theoretic Incompleteness , 1992, World Scientific Series in Computer Science.

[2] Gregory J. Chaitin. The Berry paradox , 1995, Complex..

[3] Gregory J. Chaitin,et al. The Limits of Mathematics---Tutorial Version , 1995, chao-dyn/9509010.

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

[5] G. Chaitin. Randomness in arithmetic and the decline and fall of reductionism in pure mathematics , 1993, chao-dyn/9304002.

[6] Gregory J. Chaitin,et al. The Limits of Mathematics , 1995, J. Univers. Comput. Sci..

[7] Gregory J. Chaitin. A new version of algorithmic information theory , 1996, Complex..

[8] Gregory J. Chaitin. The Limits of Mathematics---Extended Abstract , 1994 .

[9] David B. Fogel,et al. Cooperation and conflict in general evolutionary processes , 1996 .