THE ARCHITECTURE OF COMPLEXITY - A NEW BLUEPRINT

被引：3
作者：
TURNEY, P
机构：
来源：
SYNTHESE | 1989年 / 79卷 / 03期
关键词：
D O I：
10.1007/BF00869285
中图分类号：
N09 [自然科学史]; B [哲学、宗教];
学科分类号：
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要：
引用
收藏
页码：515 / 542
页数：28
相关论文
共 22 条
[1]   INDUCTIVE INFERENCE - THEORY AND METHODS [J].
ANGLUIN, D ;
SMITH, CH .
COMPUTING SURVEYS, 1983, 15 (03) :237-269
[2]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[3]   TOWARD A MATHEMATICAL THEORY OF INDUCTIVE INFERENCE [J].
BLUM, L ;
BLUM, M .
INFORMATION AND CONTROL, 1975, 28 (02) :125-155
[4]  
Boolos G., 1980, COMPUTABILITY LOGIC
[5]  
BUNGE M, 1963, MYTH SIMPLICITY
[6]   A RECURSIVE ALGORITHM FOR FINDING RELIABILITY-MEASURES RELATED TO THE CONNECTION OF NODES IN A GRAPH [J].
BUZACOTT, JA .
NETWORKS, 1980, 10 (04) :311-327
[7]  
Dawkins R., 1976, GROWING POINTS ETHOL, P7
[8]  
FRANK H, 1972, AFIPS C P, V40, P255
[9]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[10]  
Goodman N, 1972, PROBLEMS PROJECTS
123