ON SIZE OF MACHINES

被引:78
作者
BLUM, M
机构
来源
INFORMATION AND CONTROL | 1967年 / 11卷 / 03期
关键词
D O I
10.1016/S0019-9958(67)90546-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:257 / &
相关论文
共 11 条
[1]  
ARBIB M, 1965, P AM MATH SOC, V16, P442
[2]  
ARBIB MA, 1966, AUTOMATA THEORY, P6
[3]   A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J].
BLUM, M .
JOURNAL OF THE ACM, 1967, 14 (02) :322-&
[4]  
CAIANIELLO ER, 1966, AUTOMATA THEORY ED, P6
[5]   ON LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES [J].
CHAITIN, GJ .
JOURNAL OF THE ACM, 1966, 13 (04) :547-+
[6]  
CHAITIN GJ, IN PRESS
[7]  
Davis M., 1958, COMPUTABILITY UNSOLV
[8]   ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J].
HARTMANIS, J ;
STEARNS, RE .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) :285-+
[9]  
Minsky M., 1962, RECURSIVE FUNCTION T, V5, P229
[10]  
Rogers H., 1958, J SYMBOLIC LOGIC, V23, P331, DOI [10.2307/2964292, DOI 10.2307/2964292]