A MACHINE-INDEPENDENT THEORY OF COMPLEXITY OF RECURSIVE FUNCTIONS

被引：411

作者：

BLUM, M

机构：

来源：

关键词：

D O I：

10.1145/321386.321395

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：322 / &

共 13 条

[1]

ARBIB M, 1965, P AM MATH SOC, V16, P442

[2]

COBHAM A, 1965, 1964 P INT C LOG MET, P24

[3]

COOKE SA, 1966, BL41 BELL LABS REP

[4] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J].

HARTMANIS, J ;

STEARNS, RE .

[5]

HARTMANIS J, 1964, 5 P ANN S SWITCH THE

[6]

MYHILL J, 1960, WADD60165

[7] REAL TIME COMPUTATION [J].

RABIN, MO .

[8]

RABIN MO, 1960, 2 HEBR U TECH REP

[9]

Ritchie R. W., 1963, T AM MATH SOC, V106, P139, DOI DOI 10.1090/S0002-9947-1963-0158822-2

[10]

Rogers H., 1958, J SYMBOLIC LOGIC, V23, P331, DOI [10.2307/2964292, DOI 10.2307/2964292]