INCOMPLETENESS THEOREMS FOR RANDOM REALS

被引：65

作者：

CHAITIN, GJ

机构：

来源：

关键词：

D O I：

10.1016/0196-8858(87)90010-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：119 / 146

页数：28

共 16 条

[1] GODEL THEOREM AND INFORMATION [J].

CHAITIN, GJ .

[2] INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY [J].

CHAITIN, GJ .

[3] RANDOMNESS AND MATHEMATICAL PROOF [J].

CHAITIN, GJ .

[4] THEORY OF PROGRAM SIZE FORMALLY IDENTICAL TO INFORMATION-THEORY [J].

CHAITIN, GJ .

[5]

CHAITIN GJ, IN PRESS MONDES DEV, V14

[6]

Courant R., 1941, WHAT IS MATH

[7] DECISION PROBLEM FOR EXPONENTIAL DIOPHANTINE EQUATIONS [J].

DAVIS, M ;

PUTNAM, H ;

ROBINSON, J .

[8]

Davis Martin, 1965, UNDECIDABLE BASIC PA

[9]

Feller W., 1970, INTRO PROBABILITY TH, V1

[10]

HARDY GH, 1952, COURSE PURE MATH