ON REVERSAL COMPLEXITY FOR ALTERNATING TURING-MACHINES

被引：0

|

作者：

LISKIEWICZ, M

LORYS, K

机构：

来源：

30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 1989年

关键词：

D O I：

10.1109/SFCS.1989.63544

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

下载

收藏

页码：618 / 623

页数：6

相关论文

共 50 条

[21] AUTOMATED MODELS OF TURING-MACHINES
ZAKHAROV, VA
DOKLADY AKADEMII NAUK SSSR, 1986, 291 (02): : 280 - 284
[22] UNIVERSAL LIMIT TURING-MACHINES
BURGIN, MS
DOKLADY AKADEMII NAUK, 1992, 325 (04) : 654 - 658
[23] TWO-DIMENSIONAL ALTERNATING TURING-MACHINES WITH ONLY UNIVERSAL STATES
ITO, A
INOUE, K
TAKANAMI, I
TANIGUCHI, H
INFORMATION AND CONTROL, 1982, 55 (1-3): : 193 - 221
[24] REPRESENTING THE KNOWLEDGE OF TURING-MACHINES
SHIN, HS
WILLIAMSON, T
THEORY AND DECISION, 1994, 37 (01) : 125 - 146
[25] RECONCILING OO WITH TURING-MACHINES
BERRISFORD, G
BURROWS, M
COMPUTER JOURNAL, 1994, 37 (10): : 888 - 906
[26] TURING-MACHINES WITH ACCESS TO HISTORY
CHLEBUS, BS
INFORMATION AND COMPUTATION, 1990, 89 (02) : 133 - 143
[27] STRUCTURED PROGRAMS FOR TURING-MACHINES
PASSY, S
INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 63 - 67
[28] TO THE FUNCTIONAL EQUIVALENCE OF TURING-MACHINES
ZAKHAROV, VA
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 488 - 491
[29] THE COMPLEXITY OF ONLINE SIMULATIONS BETWEEN MULTIDIMENSIONAL TURING-MACHINES AND RANDOM-ACCESS MACHINES
LOUI, MC
LUGINBUHL, DR
MATHEMATICAL SYSTEMS THEORY, 1992, 25 (04): : 293 - 308
[30] 2 CLASSES OF THE TURING-MACHINES
BUDKO, AE
DOKLADY AKADEMII NAUK BELARUSI, 1985, 29 (09): : 792 - 793

← 1 2 3 4 5 →