Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Despite a high and growing global average income, billions of human beings are still condemned to life long severe poverty, with… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Precise… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time information… Expand
Is this relevant?
Highly Cited
1972
Highly Cited
1972
USEFUL FACTS ABOUT SETS. SENTENTIAL LOGIC. FIRST-ORDER LOGIC. UNDECIDABILITY. SECOND-ORDER LOGIC. 
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1966
Highly Cited
1966
Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1936
Highly Cited
1936
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire… Expand
Is this relevant?