TOWARD A MATHEMATICAL THEORY OF INDUCTIVE INFERENCE

被引:376
作者
BLUM, L
BLUM, M
机构
[1] MILLS COLL,DEPT MATH & COMP SCI,OAKLAND,CA 94613
[2] UNIV CALIF,DEPT MATH,BERKELEY,CA 94720
[3] UNIV CALIF,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720
[4] UNIV CALIF,ELECTR RES LAB,BERKELEY,CA 94720
来源
INFORMATION AND CONTROL | 1975年 / 28卷 / 02期
关键词
D O I
10.1016/S0019-9958(75)90261-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:125 / 155
页数:31
相关论文
共 26 条
[1]  
ADELMAN L, 1973, COMMUNICATION
[2]  
ADELMAN L, TO BE PUBLISHED
[3]  
ANGLUIN D, TO BE PUBLISHED
[4]  
Barzdin J. M., 1972, SOV MATH DOKL, V13, P1224
[5]  
BIERMANN A, 1971, CS241 STANF U COMP S
[6]   A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS [J].
BLUM, M .
JOURNAL OF THE ACM, 1967, 14 (02) :322-&
[7]  
DALEY RP, 1974, INFERENCE OPTIMAL DE
[8]   SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY [J].
FELDMAN, J .
INFORMATION AND CONTROL, 1972, 20 (03) :244-&
[9]  
GOLD E, TO BE PUBLISHED
[10]   LANGUAGE IDENTIFICATION IN LIMIT [J].
GOLD, EM .
INFORMATION AND CONTROL, 1967, 10 (05) :447-&