Turing Machines

Turing Machines is an abstract computational model consisting of a finite control, a tape divided into cells, and a read/write head that manipulates symbols on the tape according to a set of transition rules, thereby formalizing the notion of effective computability.

1.5K

Publications

127.2K

Citations

1.8K

Authors

733

Institutions

Publications per year

2017–2026

122

Authors

1.8K

  1. IR
    Irving R. Epstein

    Brandeis University, United States

    14 publications · 883 citations

    13

    h-index

  2. BJ
    B. Jack Copeland

    University of Canterbury, New Zealand

    12 publications · 905 citations

    12

    h-index

  3. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    15 publications · 448 citations

    12

    h-index

  4. PC
    Patrick C. Fischer

    Vanderbilt University, United States

    11 publications · 560 citations

    11

    h-index

  5. HB
    Holger Boche

    Technical University of Munich, Germany

    9 publications · 180 citations

    9

    h-index

1–5 of 1.8K

Venues

  1. Choice Reviews Online

    CRO · 43 publications · 4.7K citations

    29

    h-index

  2. Theoretical Computer Science

    67 publications · 2.4K citations

    27

    h-index

  3. Journal of the ACM

    JACM · 37 publications · 8.2K citations

    27

    h-index

  4. SIAM Journal on Computing

    37 publications · 5.1K citations

    25

    h-index

  5. Journal of Computer and System Sciences

    30 publications · 4.1K citations

    22

    h-index

1–5