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

Authors

119

  1. ES
    Endre Szemerédi

    Hungarian Academy of Sciences, Hungary

    4 publications · 191 citations

    4

    h-index

  2. RK
    Ravi Kannan

    Carnegie Mellon University, United States

    4 publications · 94 citations

    4

    h-index

  3. HZ
    Héctor Zenil

    Karolinska Institutet, Sweden

    4 publications · 132 citations

    4

    h-index

  4. JD
    Jean-Paul Delahaye

    Laboratoire d'Informatique Fondamentale de Lille, France

    4 publications · 132 citations

    4

    h-index

  5. WM
    Wolfgang Maass

    Graz University of Technology, Austria

    4 publications · 124 citations

    4

    h-index

1–5 of 119

Venues

  1. SIAM Journal on Computing

    14 publications · 1.4K citations

    13

    h-index

  2. Theoretical Computer Science

    5 publications · 143 citations

    5

    h-index

  3. Journal of Computer and System Sciences

    4 publications · 1.5K citations

    4

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 435 citations

    3

    h-index

  5. Fundamenta Informaticae

    3 publications · 57 citations

    3

    h-index

1–5