Skip to search formSkip to main contentSkip to account menu

Undecidable problem

Known as: Uncomputable problem, Undecidable set, Semidecidable 
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is known to be impossible to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AIXIAbstract machineAbstract rewriting systemAbstraction (software engineering)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation… 
Highly Cited
2004
Highly Cited
2004
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms… 
Highly Cited
2000
Highly Cited
2000
Context-sensitive synchronization-sensitive analysis is undecidable
Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Precise… 
Highly Cited
1999
Highly Cited
1999
On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems
We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decision… 
Highly Cited
1998
Highly Cited
1998
Metamathematics of Fuzzy Logic
  • P. Hájek
  • Trends in Logic
  • 1998
  • Corpus ID: 61701554
Preface. 1. Preliminaries. 2. Many-Valued Propositional Calculi. 3. Lukasiewicz Propositional Logic. 4. Product Logic, Godel… 
Highly Cited
1998
Highly Cited
1998
Reset Nets Between Decidability and Undecidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net… 
Highly Cited
1992
Highly Cited
1992
Undecidability of static analysis
Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time information… 
Highly Cited
1992
Highly Cited
1992
Bounded quantification is undecidable
  • B. Pierce
  • ACM-SIGACT Symposium on Principles of Programming…
  • 1992
  • Corpus ID: 14218142
F≤ is a typed λ-calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has been… 
Highly Cited
1972
Highly Cited
1972
A mathematical introduction to logic
Highly Cited
1971
Highly Cited
1971
Undecidability and nonperiodicity for tilings of the plane
This paper is related to the work of Hao Wang and others growing out of a problem which he proposed in [8], w 4.1. Suppose that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)