Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,692,739 papers from all fields of science
Search
Sign In
Create Free Account
Undecidable problem
Known as:
Uncomputable problem
, Undecidable set
, Semidecidable
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AIXI
Abstract machine
Abstract rewriting system
Abstraction (software engineering)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Incorporating XSL Processing into Database Engines
G. Moerkotte
Very Large Data Bases Conference
2002
Corpus ID: 17857552
1997
1997
Refined Termination Decision in Active Databases
Sin Yeung Lee
,
T. Ling
International Conference on Database and Expert…
1997
Corpus ID: 36094623
Termination decision in trigger systems is important to make sure that any rule execution does not result in an infinite loop. In…
Expand
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…
Expand
Highly Cited
1993
Highly Cited
1993
Order-sorted polymorphism in Isabelle
T. Nipkow
1993
Corpus ID: 17660122
ML-style polymorphism can be generalized from a single-sorted algebra of types to an order-sorted one by adding a partially…
Expand
1993
1993
Halting Problem of One Binary Horn Clause is Undecidable
P. Devienne
,
P. Lebègue
,
J. Routier
Symposium on Theoretical Aspects of Computer…
1993
Corpus ID: 125604212
This paper proposes a codification of the halting problem of any Turing machine in the form of only one right-linear binary Horn…
Expand
1992
1992
Generalized sufficient conditions for modular termination of rewriting
B. Gramlich
Applicable Algebra in Engineering, Communication…
1992
Corpus ID: 8403630
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an…
Expand
Highly Cited
1991
Highly Cited
1991
Combining Matching Algorithms: The Regular Case
T. Nipkow
Journal of symbolic computation
1991
Corpus ID: 39923625
Highly Cited
1990
Highly Cited
1990
Higher-order functions considered unnecessary for higher-order programming
J. Goguen
1990
Corpus ID: 14411469
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions…
Expand
1990
1990
Decidable Properties of Polycyclic Groups
D. Segal
1990
Corpus ID: 11270072
The classical decision problems of group theory were formulated with finitely presented groups in mind. In this generality they…
Expand
1982
1982
Extremely undecidable sentences
G. Boolos
Journal of Symbolic Logic (JSL)
1982
Corpus ID: 6860287
Let ‘ϕ’, ‘χ’, and ‘ψ’ be variables ranging over functions from the sentence letters P0, P1, … Pn, … of (propositional) modal…
Expand
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)
ACCEPT & CONTINUE