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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation… 
Highly Cited
2004
Highly Cited
2004
Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms… 
Highly Cited
2000
Highly Cited
2000
Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Precise… 
Highly Cited
1999
Highly Cited
1999
We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decision… 
Highly Cited
1998
Highly Cited
1998
  • 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
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
Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time information… 
Highly Cited
1992
Highly Cited
1992
  • 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
Highly Cited
1971
Highly Cited
1971
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…