Keyword

halting problem

Description: The computability problem of determining whether an arbitrary program will eventually terminate or run indefinitely.

Primary topic: Computability, Logic, AI Algorithms (64%)

Wikidata ID: wiki/Q622849

OpenAlex ID: keywords/halting-problem

Computation at the edge of chaos: Phase transitions and emergent computation

1990 · Chris G. Langton · Physica D Nonlinear Phenomena · 1,527

PDF

Formal Languages and Their Relation to Automata

1969 · John E. Hopcroft, Jeffrey D. Ullman · CERN Document Server (European Organization for Nuclear Research) · 1,360

Problems of projection

2015 · Noam Chomsky · Linguistik aktuell · 388

Computation at the edge of Chaos: phase transitions and emergent computation

1991 · Christopher G. Langton · Deep Blue (University of Michigan) · 328

Undecidability of the spectral gap

2015 · Toby S. Cubitt, David Perez-Garcia, et al. · Nature · 262

PDF

Problems of projection: Extensions

2014 · Noam Chomsky · 211

MIP* = RE

2021 · Zhengfeng Ji, Anand Natarajan, et al. · Communications of the ACM · 172

PDF

Randomness and Undecidability in Physics

1993 · K Svozil · WORLD SCIENTIFIC eBooks · 172

A low and a high hierarchy within NP

1983 · Uwe Schöning · Journal of Computer and System Sciences · 160

PDF

Data flow analysis of applicative programs using minimal function graphs

1986 · Neil D. Jones, Alan Mycroft · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · 125

PDF

Halting space-bounded computations

1980 · Michael Sipser · Theoretical Computer Science · 118

PDF

Notes on labeling and subject positions

2015 · Luigi Rizzi · Linguistik aktuell · 109

Bounded Quantification Is Undecidable

1994 · B.C. Pierce · Information and Computation · 108

Chemical implementation of finite-state machines.

1992 · A Hjelmfelt, E D Weinberger, et al. · Proceedings of the National Academy of Sciences · 99

Computational complexity

1987 · Christopher G. Langton · Mathematical Biosciences · 94

LLMs Will Always Hallucinate, and We Need to Live with This

2025 · Sourav Banerjee, Ayushi Agarwal, et al. · Lecture notes in networks and systems · 92

PDF

The AI Advantage:How to Put the Artificial Intelligence Revolution to Work

2019 · Rajendra K. Bera · 92

Tarski’s Finite Basis Problem Is Undecidable

1996 · RALPH MCKENZIE · International Journal of Algebra and Computation · 89

The Universal Turing Machine: A Half-Century Survey

1990 · 89

A Programming Approach to Computability

1982 · A. J. Kfoury, Robert N. Moll, et al. · Springer eBooks · 88

Cornerstones of undecidability

1994 · Grzegorz Rozenberg, Arto Salomaa · Medical Entomology and Zoology · 85

An Approach to the Problem of Detranslation of Computer Programs

1980 · R. N. Horspool, N. Marovac · The Computer Journal · 84

Quantum Algorithm for Hilbert's Tenth Problem

2003 · Tien D Kieu · International Journal of Theoretical Physics · 81

PDF

What’s Decidable about Weighted Automata?

2011 · Shaull Almagor, Udi Boker, et al. · Lecture notes in computer science · 79

Accelerating Turing Machines

2002 · B. Jack Copeland · Minds and Machines · 79

Works count: 1,687

Citation count: 12,110