Incompleteness theorems for random reals

Advances in Applied Mathematics - Tập 8 - Trang 119-146 - 1987
G.J Chaitin1
1IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, USA

Tài liệu tham khảo

Chaitin, 1974, Information-theoretic computational complexity, IEEE Trans. Inform. Theory, 20, 10, 10.1109/TIT.1974.1055172

Chaitin, 1975, Randomness and mathematical proof, Sci. Amer., 232, 47, 10.1038/scientificamerican0575-47

Chaitin, 1975, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach., 22, 329, 10.1145/321892.321894

Chaitin, 1982, Gödel's theorem and information, Internat. J. Theoret. Phys., 22, 941, 10.1007/BF02084159

G. J. Chaitin, Randomness and Gödel's theorem, “Mondes en Développement,” Vol. 14, No. 53, in press.

Courant, 1941

Davis, 1961, The decision problem for exponential diophantine equations, Ann. Math., 74, 425, 10.2307/1970289

Davis, 1965

Feller, 1970

Hardy, 1952

Jones, 1984, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, J. Symbolic Logic, 49, 818, 10.2307/2274135

Martin-Löf, 1966, The definition of random sequences, Inform. Control, 9, 602, 10.1016/S0019-9958(66)80018-9

Shannon, 1949

R. M. Solovay, Private communication, 1975.

Turing, 1937, On computable numbers, with an application to the Entscheidungsproblem, 42, 230

Thông tin
Thông tin xuất bản

Advances in Applied Mathematics

Tập 8

119-146

Thông tin tác giả