Timeline for Are the Millennium Prize Problems all decidable? [closed]
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2013 at 20:08 | comment | added | John Sidles | A closely related question is my own For which Millennium Problems does undecidable -> true?. Perhaps because the latter question is more specific, it attracted no adverse comments; neither was it answered. Apparently questions in this class are generically difficult and open. | |
| Oct 19, 2012 at 5:21 | comment | added | vzn | can someone provide the link to the duplicate question if there really is one? | |
| Jul 29, 2011 at 12:59 | comment | added | Joel David Hamkins | +1. I voted to re-open, since the question seems quite reasonable to me, and I can imagine that additional answers might be posted about whether any of the specific problems have such a nature that one can prove something about the possiblility that they are independent. (Which is to say nothing against David's excellent current answer.) | |
| Jul 28, 2011 at 14:31 | vote | accept | Vijay Viswanathan | ||
| Apr 18, 2011 at 19:28 | history | edited | Qfwfq | CC BY-SA 3.0 |
edited body
|
| Apr 18, 2011 at 17:41 | history | closed |
Gerald Edgar Harry Gindi user6976 Zev Chonoles Mariano Suárez-Álvarez |
off topic | |
| Apr 18, 2011 at 17:22 | answer | added | David E Speyer | timeline score: 42 | |
| Apr 18, 2011 at 17:20 | comment | added | Thierry Zell | Your question does seem a little bit off, because if any such problem was proved to be independent of some mainstream axiomatic system such as ZFC, you would have definitely heard about it. As for the question is it possible that one of them is, I seem to recall that this has been extensively discussed on MO already. | |
| Apr 18, 2011 at 16:12 | answer | added | Henry Towsner | timeline score: 3 | |
| Apr 18, 2011 at 16:01 | history | asked | Vijay Viswanathan | CC BY-SA 3.0 |