Turing Machines
Turing Machines is an abstract computational model consisting of a finite control, a tape divided into cells, and a read/write head that manipulates symbols on the tape according to a set of transition rules, thereby formalizing the notion of effective computability.
1.5K
Publications
127.2K
Citations
1.8K
Authors
733
Institutions
Publications per year
2017–2026
122
1.5K
I.—COMPUTING MACHINERY AND INTELLIGENCE
Alan Turing · Mind · 1950 · 9.6K citations
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Introduction to the Theory of Computation
Michael Sipser · ACM SIGACT News · 1996 · 2.8K citations
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
1–5 of 1.5K
1.8K
13
h-index
12
h-index
University of California, Santa Barbara, United States
15 publications · 448 citations
12
h-index
11
h-index
9
h-index
1–5 of 1.8K
733

Cornell University
Ithaca, United States
23 h-index
42 publications
3K citations
University of California, Berkeley
Berkeley, United States
22 h-index
34 publications
3.4K citations
IBM (United States)
Armonk, United States
17 h-index
26 publications
4.5K citations
University of Chicago
Chicago, United States
17 h-index
22 publications
2.9K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
31 publications
2.1K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
24 publications
5.9K citations

Pennsylvania State University
State College, United States
14 h-index
18 publications
664 citations

University of Minnesota
Minneapolis, United States
14 h-index
24 publications
1.2K citations
1–8 of 733
CRO · 43 publications · 4.7K citations
29
h-index
67 publications · 2.4K citations
27
h-index
JACM · 37 publications · 8.2K citations
27
h-index
37 publications · 5.1K citations
25
h-index
30 publications · 4.1K citations
22
h-index
1–5