Nondeterministic Turing Machines
A Nondeterministic Turing Machine is a theoretical computational model that extends the standard Turing machine by allowing multiple possible transitions from a given state and tape symbol, thereby enabling nondeterministic computation paths that explore all potential decisions simultaneously in parallel.
167
Publications
18.3K
Citations
222
Authors
151
Institutions
Publications per year
2017–2026
2
Parents
167
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text
Parallelism in random access machines
Steven Fortune, James Wyllie · 1978 · 885 citations
Computational Complexity of Probabilistic Turing Machines
John Gill · SIAM Journal on Computing · 1977 · 694 citations
1–5 of 167
222
8
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 222
151

Cornell University
Ithaca, United States
10 h-index
12 publications
762 citations

University of Minnesota
Minneapolis, United States
5 h-index
8 publications
554 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
7 publications
2K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
7 publications
3.9K citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
6 publications
380 citations
University of Washington
Seattle, United States
4 h-index
6 publications
541 citations
IBM (United States)
Armonk, United States
4 h-index
5 publications
611 citations

University of Electro-Communications
Tokyo, Japan
4 h-index
7 publications
219 citations
1–8 of 151
22 publications · 2.3K citations
17
h-index
14 publications · 435 citations
14
h-index
10 publications · 1K citations
10
h-index
JACM · 10 publications · 1.7K citations
10
h-index
IJFCS · 4 publications · 115 citations
4
h-index
1–5