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
Variants
Church-turing-thesis
Parents
550
Introduction to the Theory of Computation
Michael Sipser · ACM SIGACT News · 1996 · 2.8K citations
A Computing Procedure for Quantification Theory
Martin Davis, Hilary Putnam · Journal of the ACM · 1960 · 2.6K citations · Full text
1–5 of 550
664
10
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 664
334

University of Canterbury
Christchurch, New Zealand
10 h-index
14 publications
778 citations

University of Edinburgh
Edinburgh, United Kingdom
9 h-index
9 publications
2.2K citations
Utrecht University
Utrecht, The Netherlands
9 h-index
9 publications
208 citations
University of Chicago
Chicago, United States
8 h-index
10 publications
549 citations
Princeton University
Princeton, United States
7 h-index
9 publications
12.3K citations
University of Oxford
Oxford, United Kingdom
7 h-index
7 publications
4.9K citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
6 publications
559 citations

University of Toronto
Toronto, Canada
6 h-index
8 publications
626 citations
1–8 of 334
38 publications · 3K citations
25
h-index
26 publications · 3.1K citations
19
h-index
CRO · 18 publications · 1.1K citations
15
h-index
18 publications · 654 citations
13
h-index
15 publications · 590 citations
13
h-index
1–5