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

Authors

222

  1. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    8 publications · 252 citations

    8

    h-index

  2. PC
    Patrick C. Fischer

    Vanderbilt University, United States

    5 publications · 260 citations

    5

    h-index

  3. RV
    Ronald V. Book

    University of California, Santa Barbara, United States

    5 publications · 339 citations

    5

    h-index

  4. GS
    Georg Schnitger

    Goethe University Frankfurt, Germany

    4 publications · 67 citations

    4

    h-index

  5. JS
    Joel Seiferas

    University of Rochester, United States

    4 publications · 71 citations

    4

    h-index

1–5 of 222

Venues

  1. SIAM Journal on Computing

    22 publications · 2.3K citations

    17

    h-index

  2. Theoretical Computer Science

    14 publications · 435 citations

    14

    h-index

  3. Journal of Computer and System Sciences

    10 publications · 1K citations

    10

    h-index

  4. Journal of the ACM

    JACM · 10 publications · 1.7K citations

    10

    h-index

  5. International Journal of Foundations of Computer Science

    IJFCS · 4 publications · 115 citations

    4

    h-index

1–5