Algorithmic information theory and undecidability

被引：7

作者：

Raatikainen, P

机构：

来源：

关键词：

D O I：

10.1023/A:1005298819345

中图分类号：

N09 [自然科学史]; B [哲学、宗教];

学科分类号：

01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;

摘要：

[No abstract available]

引用

页码：217 / 225

页数：9

共 30 条

[1]

[Anonymous], 1937, J SYMBOLIC LOGIC, DOI 10.2307/2266293

[2]

[Anonymous], 1933, LOGIC SEMANTICS META

[3]

CHAITIN G, 1990, NEW SCI, V125, P44

[4]

CHAITIN G, 1987, ALGORITHMIC INFORMAT

[5] INFORMATION-THEORETIC INCOMPLETENESS [J].

CHAITIN, GJ .

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

CHAITIN, GJ .

[7] INFORMATION-THEORETIC LIMITATIONS OF FORMAL SYSTEMS [J].

CHAITIN, GJ .

[8] RANDOMNESS IN ARITHMETIC [J].

CHAITIN, GJ .

[9] INCOMPLETENESS THEOREMS FOR RANDOM REALS [J].

CHAITIN, GJ .

[10] RANDOMNESS AND MATHEMATICAL PROOF [J].

CHAITIN, GJ .