Turing Machine Computability

Turing Machine Computability is the formal property of a function or problem being solvable by a Turing machine, distinguishing it as the foundational criterion for effective computability in mathematical logic and theoretical computer science.

356

Publications

29.4K

Citations

484

Authors

286

Institutions

Publications per year

2017–2026

45

Variants

Turing Computability

Authors

484

  1. HB
    Holger Boche

    Technical University of Munich, Germany

    15 publications · 324 citations

    12

    h-index

  2. RF
    Rafael F. Schaefer

    Princeton University, United States

    7 publications · 174 citations

    7

    h-index

  3. BJ
    B. Jack Copeland

    University of Canterbury, New Zealand

    7 publications · 476 citations

    7

    h-index

  4. HV
    H. Vincent Poor

    Princeton University, United States

    7 publications · 174 citations

    7

    h-index

  5. RI
    Robert I. Soare

    University of Chicago, United States

    5 publications · 414 citations

    5

    h-index

1–5 of 484

Venues

  1. SIAM Journal on Computing

    13 publications · 1.1K citations

    12

    h-index

  2. Journal of the ACM

    JACM · 13 publications · 2.8K citations

    11

    h-index

  3. Choice Reviews Online

    CRO · 7 publications · 873 citations

    7

    h-index

  4. arXiv (Cornell University)

    Repository · 7 publications · 103 citations

    7

    h-index

  5. Journal of Symbolic Logic

    7 publications · 511 citations

    7

    h-index

1–5