Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 79622

decision problems that are at least as hard as NP-complete problems

0
votes
0answers
Let us define the language (the complement of the Halting Problem): $$ LOOPING = \left\{ \langle M,x \rangle | M \ doesn't \ halt \ on \ x\right\} $$ The question is if $LOOPING$ is NP-Hard. I'm pre …
asked Dec 23 '17 by user3636583