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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this paper we give a new undecidability result about tiling problems. Given a -nite set of polyomino types, the problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at ny… (More)
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… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We show that the boundedness of the set of all products of a given pair Σ of rational matrices is undecidable. Furthermore, we… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We investigate the computability of problems in probabilistic planning and partially observable infinite-horizon Markov decision… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We consider the veriication of a particular class of innnite-state systems, namely systems consisting of nite-state processes… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
D Datalog is a powerful query language for relational databases [lo]. We consider the problems of determining containment… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
F≤ is a typed λ-calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has been… (More)
  • figure 2
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… (More)
Is this relevant?