Search Results
| 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 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| 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 decidability
Search options not deleted
user 12978
22
votes
Are there any undecidability results that are not known to have a diagonal argument proof?
From a point of view your question relates to an "open conjecture" in computability theory.
I think you are asking if there is a specific problem $P$, which can be shown to be undecidable, but not wit …
- 6,287
50
votes
Two (probably) equal real numbers which are not proved to be equal?
One thing which I find crazy about this example (and which might ruin it for you), is that while this equation has never been rigorously proved, it’s truth/falsity is decidable by the decidability of real-closed …