Church-turing Thesis

The Church-Turing Thesis is a hypothesis in computability theory asserting that any function computable by an effective procedure can be computed by a Turing machine, thereby equating intuitive notions of algorithmic computation with formal models of computation.

550

Publications

58.4K

Citations

664

Authors

334

Institutions

Publications per year

2017–2026

36

Authors

664

  1. BJ
    B. Jack Copeland

    University of Canterbury, New Zealand

    11 publications · 758 citations

    10

    h-index

  2. MA
    Michael A. Harrison

    University of California, Berkeley, United States

    6 publications · 365 citations

    6

    h-index

  3. JF
    José Félix Costa

    University of Lisbon, Portugal

    5 publications · 107 citations

    5

    h-index

  4. SC
    Stephen Cook

    University of Toronto, Canada

    5 publications · 667 citations

    5

    h-index

  5. DP
    Diane Proudfoot

    University of Canterbury, New Zealand

    4 publications · 241 citations

    4

    h-index

1–5 of 664

Venues

  1. Theoretical Computer Science

    38 publications · 3K citations

    25

    h-index

  2. Journal of Symbolic Logic

    26 publications · 3.1K citations

    19

    h-index

  3. Choice Reviews Online

    CRO · 18 publications · 1.1K citations

    15

    h-index

  4. Annals of Pure and Applied Logic

    18 publications · 654 citations

    13

    h-index

  5. Minds and Machines

    15 publications · 590 citations

    13

    h-index

1–5