TURING-MACHINES

被引：22

作者：

HOPCROFT, JE

机构：

来源：

SCIENTIFIC AMERICAN | 1984年 / 250卷 / 05期

关键词：

Computers;

D O I：

10.1038/scientificamerican0584-86

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

At its logical base every digital computer embodies Turing Machines, which were invented by the British mathematician A. M. Turing. The machines mark off the limits of computability. This article presents a theoretical discussion of this device.

引用

页码：86 / &

共 50 条

[1] TURING-MACHINES AND THE ENTSCHEIDUNGSPROBLEM
BUCHI, JR
[J]. MATHEMATISCHE ANNALEN, 1962, 148 (03) : 201 - 213
[2] UNIVERSAL LIMIT TURING-MACHINES
BURGIN, MS
[J]. DOKLADY AKADEMII NAUK, 1992, 325 (04) : 654 - 658
[3] AUTOMATED MODELS OF TURING-MACHINES
ZAKHAROV, VA
[J]. DOKLADY AKADEMII NAUK SSSR, 1986, 291 (02): : 280 - 284
[4] REPRESENTING THE KNOWLEDGE OF TURING-MACHINES
SHIN, HS
WILLIAMSON, T
[J]. THEORY AND DECISION, 1994, 37 (01) : 125 - 146
[5] RECONCILING OO WITH TURING-MACHINES
BERRISFORD, G
BURROWS, M
[J]. COMPUTER JOURNAL, 1994, 37 (10): : 888 - 906
[6] TURING-MACHINES WITH ACCESS TO HISTORY
CHLEBUS, BS
[J]. INFORMATION AND COMPUTATION, 1990, 89 (02) : 133 - 143
[7] STRUCTURED PROGRAMS FOR TURING-MACHINES
PASSY, S
[J]. INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 63 - 67
[8] TO THE FUNCTIONAL EQUIVALENCE OF TURING-MACHINES
ZAKHAROV, VA
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 488 - 491
[9] 2 CLASSES OF THE TURING-MACHINES
BUDKO, AE
[J]. DOKLADY AKADEMII NAUK BELARUSI, 1985, 29 (09): : 792 - 793
[10] A RELATIONSHIP BETWEEN NONDETERMINISTIC TURING-MACHINES AND 1-INKDOT TURING-MACHINES WITH SMALL SPACE
INOUE, K
ITO, A
TAKANAMI, I
[J]. INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 225 - 227

← 1 2 3 4 5 →