Timeline for Existence of unknowable algorithms ?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2013 at 14:42 | comment | added | Loïc Teyssier | Thank you for your answer. I did remove my previous comment because I did not understand fully both what you meant and what I sought :) I hope my edit correct that. | |
| Apr 6, 2013 at 11:21 | comment | added | XL _At_Here_There | @Goldstern,what do you think about the dovetailed computation? | |
| Apr 5, 2013 at 18:32 | comment | added | Benjamin Steinberg | I prefer Sapir's answer. This is not an algorithmic task. For example, replace P=NP by CH. Then it depends on your ambient model of ZFC which machine works. | |
| Apr 5, 2013 at 16:00 | comment | added | Goldstern | My answer is so nonconstructive that not only is the algorithm given in a "non-constructive, purely existential" way, but even the task the algorithm has to perform is given in a "non-constructive, purely existential" way. (I think we agree that there will always be open questions.) | |
| Apr 5, 2013 at 15:27 | comment | added | XL _At_Here_There | And one day,we will have proven RH,and constructed a algorithm. So,the question is really ambiguous | |
| Apr 5, 2013 at 15:20 | history | answered | Goldstern | CC BY-SA 3.0 |