Turing Machine Model
The Turing Machine Model is a theoretical computational model consisting of an abstract machine that manipulates symbols on a strip of tape according to a set of transition rules, serving as a formal framework to define and analyze the limits of algorithmic computation.
531
Publications
53.9K
Citations
768
Authors
421
Institutions
Publications per year
2017–2026
65
Parents
531
Thomas Nagel · The Philosophical Review · 1974 · 6.8K citations
Humanities, Philosophy, Psychology +13
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
Software protection and simulation on oblivious RAMs
Oded Goldreich, Rafail Ostrovsky · Journal of the ACM · 1996 · 1.6K citations · Full text
1–5 of 531
768
8
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 768
421

Cornell University
Ithaca, United States
12 h-index
16 publications
1.2K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
16 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
16 publications
3.3K citations
University of Oxford
Oxford, United Kingdom
10 h-index
13 publications
5.5K citations
Technical University of Munich
Munich, Germany
8 h-index
11 publications
222 citations
University of California San Diego
San Diego, United States
6 h-index
8 publications
799 citations
Columbia University
New York, United States
6 h-index
6 publications
142 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
8 publications
344 citations
1–8 of 421
30 publications · 1.1K citations
20
h-index
Repository · 14 publications · 559 citations
12
h-index
CRO · 12 publications · 1.3K citations
12
h-index
12 publications · 1.1K citations
12
h-index
JACM · 14 publications · 4K citations
12
h-index
1–5