Computability Theory is a branch of mathematical logic and theoretical computer science that studies the inherent limits of algorithmic computation by identifying which problems can be solved by effective procedures and which are fundamentally unsolvable.
1.6K
Publications
99K
Citations
1.7K
Authors
646
Institutions
Publications per year
2017–2026
129
Publications
1.6K
Introduction to the Theory of Computation
Michael Sipser · ACM SIGACT News · 1996 · 2.8K citations
Tillmann Baumgratz, M. Cramer, Martin B. Plenio · Physical Review Letters · 2014 · 2.7K citations · Full text
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
1–5 of 1.6K
Authors
1.7K
- KW
14
h-index
- AN
13
h-index
- RA
13
h-index
- GJ
13
h-index
- VH
12
h-index
1–5 of 1.7K
Institutions
646
University of Chicago
Chicago, United States
23 h-index
56 publications
2.1K citations
Massachusetts Institute of Technology
Cambridge, United States
23 h-index
39 publications
6.3K citations
Cornell University
Ithaca, United States
22 h-index
52 publications
2.3K citations
University of Wisconsin–Madison
Madison, United States
19 h-index
43 publications
1.5K citations
Centre National de la Recherche Scientifique
Paris, France
19 h-index
40 publications
1.6K citations
Weizmann Institute of Science
Rehovot, Israel
18 h-index
27 publications
2.4K citations
University of Notre Dame
Notre Dame, United States
18 h-index
33 publications
1.3K citations
University of California, Berkeley
Berkeley, United States
18 h-index
43 publications
1.5K citations
1–8 of 646
Venues
- Journal of Symbolic Logic
121 publications · 7K citations
38
h-index
- Theoretical Computer Science
72 publications · 3.7K citations
34
h-index
- SIAM Journal on Computing
47 publications · 4K citations
30
h-index
- Mathematical logic quarterly
MLQ · 44 publications · 1.3K citations
21
h-index
- Annals of Pure and Applied Logic
31 publications · 1.1K citations
19
h-index
1–5