Deterministic Turing Machines
A Deterministic Turing Machine is a theoretical computational model in which, for any given state and tape symbol, there exists exactly one defined transition rule that uniquely determines the next state, the output symbol, and the direction of head movement, distinguishing it from nondeterministic variants by enforcing a single computation path.
89
Publications
6.1K
Citations
119
Authors
91
Institutions
Publications per year
2017–2026
1
Parents
89
Computational Complexity of Probabilistic Turing Machines
John Gill · SIAM Journal on Computing · 1977 · 694 citations
Computationally Related Problems
Sartaj Sahni · SIAM Journal on Computing · 1974 · 362 citations
A Catalog of Complexity Classes.
David S. Johnson · 1990 · 270 citations
John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant · Journal of the ACM · 1977 · 255 citations · Full text
1–5 of 89
119
4
h-index
4
h-index
4
h-index
Laboratoire d'Informatique Fondamentale de Lille, France
4 publications · 132 citations
4
h-index
4
h-index
1–5 of 119
91
University of California, Berkeley
Berkeley, United States
4 h-index
4 publications
139 citations

Pennsylvania State University
State College, United States
4 h-index
6 publications
311 citations
University of Illinois Chicago
Chicago, United States
4 h-index
4 publications
124 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
67 citations

Universidad de Sevilla
Seville, Spain
3 h-index
4 publications
121 citations

Cornell University
Ithaca, United States
3 h-index
3 publications
483 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
4 publications
122 citations
University of Chicago
Chicago, United States
3 h-index
3 publications
121 citations
1–8 of 91
14 publications · 1.4K citations
13
h-index
5 publications · 143 citations
5
h-index
4 publications · 1.5K citations
4
h-index
JACM · 3 publications · 435 citations
3
h-index
3 publications · 57 citations
3
h-index
1–5