TURING-MACHINES AND COMPUTATIONAL-COMPLEXITY

被引：1

|

作者：

MARION, B

机构：

来源：

AMERICAN MATHEMATICAL MONTHLY | 1994年 / 101卷 / 01期

关键词：

D O I：

10.2307/2325127

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：61 / 65

页数：5

相关论文

共 50 条

[1] ON REVERSAL COMPLEXITY FOR ALTERNATING TURING-MACHINES
LISKIEWICZ, M
LORYS, K
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 618 - 623
[2] SPACE COMPLEXITY OF ALTERNATING TURING-MACHINES
ALBERTS, M
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 1 - 7
[3] COMPLEXITY GAPS OF TURING-MACHINES ON INFINITE WORDS
TAIMINA, D
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 436 - 439
[4] TURING-MACHINES
HOPCROFT, JE
SCIENTIFIC AMERICAN, 1984, 250 (05) : 86 - &
[5] TURING-MACHINES AND THE ENTSCHEIDUNGSPROBLEM
BUCHI, JR
MATHEMATISCHE ANNALEN, 1962, 148 (03) : 201 - 213
[6] ON THE COMPLEXITY OF LEARNING MINIMUM TIME-BOUNDED TURING-MACHINES
KO, KI
SIAM JOURNAL ON COMPUTING, 1991, 20 (05) : 962 - 986
[7] TAPE-COMPLEXITY OF NON-DETERMINED TURING-MACHINES
ALBERTS, MY
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1985, (07): : 81 - 83
[8] AUTOMATED MODELS OF TURING-MACHINES
ZAKHAROV, VA
DOKLADY AKADEMII NAUK SSSR, 1986, 291 (02): : 280 - 284
[9] UNIVERSAL LIMIT TURING-MACHINES
BURGIN, MS
DOKLADY AKADEMII NAUK, 1992, 325 (04) : 654 - 658
[10] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES
GILL, J
SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695

← 1 2 3 4 5 →