Turing Machine Model

The Turing Machine Model is a theoretical computational model consisting of an abstract machine that manipulates symbols on a strip of tape according to a set of transition rules, serving as a formal framework to define and analyze the limits of algorithmic computation.

531

Publications

53.9K

Citations

768

Authors

421

Institutions

Publications per year

2017–2026

65

Authors

768

  1. BJ
    B. Jack Copeland

    University of Canterbury, New Zealand

    8 publications · 721 citations

    8

    h-index

  2. PK
    Philip K. Maini

    University of Oxford, United Kingdom

    6 publications · 605 citations

    6

    h-index

  3. HB
    Holger Boche

    Technical University of Munich, Germany

    6 publications · 145 citations

    6

    h-index

  4. IR
    Irving R. Epstein

    Brandeis University, United States

    5 publications · 298 citations

    5

    h-index

  5. WP
    W. Paul

    Saarland University, Germany

    5 publications · 76 citations

    5

    h-index

1–5 of 768

Venues

  1. Theoretical Computer Science

    30 publications · 1.1K citations

    20

    h-index

  2. arXiv (Cornell University)

    Repository · 14 publications · 559 citations

    12

    h-index

  3. Choice Reviews Online

    CRO · 12 publications · 1.3K citations

    12

    h-index

  4. Journal of Computer and System Sciences

    12 publications · 1.1K citations

    12

    h-index

  5. Journal of the ACM

    JACM · 14 publications · 4K citations

    12

    h-index

1–5