COMPUTATIONAL COMPLEXITY AND PROBABILITY CONSTRUCTIONS

被引:18
作者
WILLIS, DG
机构
关键词
D O I
10.1145/321574.321578
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:241 / +
页数:1
相关论文
共 24 条
[1]  
[Anonymous], INFORMATION THEORY
[2]  
[Anonymous], 1906, REV METAPHYS MORALE, V14-5, P627
[3]   A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J].
BLUM, M .
JOURNAL OF THE ACM, 1967, 14 (02) :322-&
[5]   ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1966, 13 (04) :547-+
[6]  
FANO RM, 1961, TRANSMISSION INFORMA
[7]  
GREEN MW, 1964, S164 IEEE PUB, P91
[8]   ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J].
HARTMANIS, J ;
STEARNS, RE .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) :285-+
[9]  
Kolmogorov A., 1933, GRUNDBEGRIFFE WAHRSC
[10]   3 APPROACHES TO QUANTITATIVE DEFINITION OF INFORMATION [J].
KOLMOGOROV, AN .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1968, 2 (02) :157-+