Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,465,334 papers from all fields of science
Search
Sign In
Create Free Account
List of undecidable problems
Known as:
List of undecidable problem
, Undecidable
In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Abstract machine
Busy beaver
Complexity class
Computability
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
S. Krishna
,
L. Manasa
,
Ashutosh Trivedi
Language and Automata Theory and Applications
2015
Corpus ID: 32104185
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time…
Expand
2014
2014
On The Reachability Problem for Recursive Hybrid Automata with One and Two Players
S. Krishna
,
L. Manasa
,
Ashutosh Trivedi
arXiv.org
2014
Corpus ID: 5822142
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time…
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