The Halting Problem is a decision problem in computability theory that determines whether a given Turing machine will halt on a specific input, distinguishing itself as the canonical example of an undecidable problem.
104
Publications
4K
Citations
153
Authors
123
Institutions
Publications per year
2017–2026
12
Publications
104
On the Uniform Halting Problem for Term Rewriting Systems
G. Huet · Medical Entomology and Zoology · 1978 · 178 citations
Zhengfeng Ji, Anand Natarajan, Thomas Vidick et al. · Communications of the ACM · 2021 · 167 citations · Full text
Problems of projection: Extensions
Noam Chomsky · 2014 · 163 citations
Data flow analysis of applicative programs using minimal function graphs
Neil D. Jones, Alan Mycroft · 1986 · 125 citations · Full text
1–5 of 104
Authors
153
- GT
4
h-index
- TD
4
h-index
- CS
3
h-index
- AN
3
h-index
- MK
2
h-index
1–5 of 153
Institutions
123
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
4 publications
322 citations
Swinburne University of Technology
Melbourne, Australia
4 h-index
4 publications
121 citations
McGill University
Montreal, Canada
3 h-index
5 publications
300 citations
Victoria University of Wellington
Wellington, New Zealand
3 h-index
5 publications
109 citations
University of Auckland
Auckland, New Zealand
3 h-index
5 publications
203 citations
University of Copenhagen
Copenhagen, Denmark
2 h-index
2 publications
60 citations
Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
20 citations
University of Amsterdam
Amsterdam, The Netherlands
2 h-index
3 publications
46 citations
1–8 of 123
Venues
- Journal of Symbolic Logic
6 publications · 184 citations
6
h-index
- ArXiv.org
Repository · 4 publications · 95 citations
4
h-index
- Mathematical logic quarterly
MLQ · 4 publications · 68 citations
4
h-index
- Journal of the ACM
JACM · 4 publications · 159 citations
4
h-index
- Theoretical Computer Science
3 publications · 70 citations
3
h-index
1–5