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.
2002
2002
Incorporating XSL Processing into Database Engines
1997
1997
Refined Termination Decision in Active Databases
Termination decision in trigger systems is important to make sure that any rule execution does not result in an infinite loop. In… 
Highly Cited
1995
Highly Cited
1995
Decidability of linear affine logic
  • A. P. Kopylov
  • Proceedings of Tenth Annual IEEE Symposium on…
  • 1995
  • Corpus ID: 33058578
The propositional linear logic is known to be undecidable. We prove that the full propositional linear affine logic containing… 
Highly Cited
1993
Highly Cited
1993
Order-sorted polymorphism in Isabelle
ML-style polymorphism can be generalized from a single-sorted algebra of types to an order-sorted one by adding a partially… 
1993
1993
Halting Problem of One Binary Horn Clause is Undecidable
This paper proposes a codification of the halting problem of any Turing machine in the form of only one right-linear binary Horn… 
1992
1992
Generalized sufficient conditions for modular termination of rewriting
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an… 
Highly Cited
1991
Highly Cited
1991
Combining Matching Algorithms: The Regular Case
Highly Cited
1990
Highly Cited
1990
Higher-order functions considered unnecessary for higher-order programming
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions… 
1990
1990
Decidable Properties of Polycyclic Groups
The classical decision problems of group theory were formulated with finitely presented groups in mind. In this generality they… 
1982
1982
Extremely undecidable sentences
Let ‘ϕ’, ‘χ’, and ‘ψ’ be variables ranging over functions from the sentence letters P0, P1, … Pn, … of (propositional) modal… 
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)