Get started
Keyword

undecidability

Description: The property of a problem or proposition for which no general procedure can determine an answer, studied in logic and computation.
OpenAlex ID: keywords/undecidability
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
1931 · Kurt Gödel · Monatshefte für Mathematik · 2,384
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
2006 · Kurt Gödel · Monatshefte für Mathematik · 2,077
Universality and complexity in cellular automata
1984 · Stephen Wolfram · Physica D Nonlinear Phenomena · 1,915
The algorithmic analysis of hybrid systems
1995 · R. Alur, C. Courcoubetis, et al. · Theoretical Computer Science · 1,884
PDF
Finite Automata and Their Decision Problems
1959 · M. O. Rabin, D. Scott · IBM Journal of Research and Development · 1,879
Recursively enumerable sets and degrees
1978 · Robert I. Soare · Bulletin of the American Mathematical Society · 1,540
PDF
Recursively Enumerable Sets and Degrees
1987 · Robert I. Soare · Perspectives in mathematical logic · 1,339
Agent-based computational models and generative social science
1999 · Joshua M. Epstein · Complexity · 1,111
Automata on Infinite Objects
1990 · Wolfgang THOMAS · Elsevier eBooks · 1,084
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
1989 · Lenore Blum, Mike Shub, et al. · Bulletin of the American Mathematical Society · 1,056
PDF
Protection in operating systems
1976 · Michael A. Harrison, Walter L. Ruzzo, et al. · Communications of the ACM · 1,052
PDF
Stability Criteria for Switched and Hybrid Systems
2007 · Robert Shorten, Fabian Wirth, et al. · SIAM Review · 1,039
Computability and Unsolvability.
1959 · C. Elgot, Martin Davis · Mathematical Tables and Other Aids to Computation · 980
Swarm Intelligence in Cellular Robotic Systems
1993 · Gerardo Beni, Jing Wang · Springer eBooks · 974
The undecidability of the domino problem
1966 · Robert Berger · Memoirs of the American Mathematical Society · 966
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
2001 · Ian Hodkinson, Frank Wolter, et al. · Lecture notes in computer science · 961
Model-checking for real-time systems
2002 · R. Alur, C. Courcoubetis, et al. · Proceedings - Symposium on Logic in Computer Science · 897
Model-Checking in Dense Real-Time
1993 · R. Alur, C. Courcoubetis, et al. · Information and Computation · 847
A note on the Entscheidungsproblem
1936 · Alonzo Church · Journal of Symbolic Logic · 809
On the translation of languages from left to right
1965 · Donald E. Knuth · Information and Control · 784
PDF
A survey of computational complexity results in systems and control
2000 · Vincent D. Blondel, John N. Tsitsiklis · Automatica · 732
Termination of rewriting
1987 · Nachum Dershowitz · Journal of Symbolic Computation · 713
PDF
Undecidability and nonperiodicity for tilings of the plane
1971 · Raphael M. Robinson · Inventiones mathematicae · 697
Semi-qualitative Reasoning about Distances: A Preliminary Report
2000 · Holger Sturm, Nobu-Yuki Suzuki, et al. · Lecture notes in computer science · 674
What's Decidable about Hybrid Automata?
1998 · Thomas A. Henzinger, Peter W. Kopke, et al. · Journal of Computer and System Sciences · 661
PDF
Works count: 12,110
Citation count: 153,100
Year
Topic
Type