Timeline for Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Mar 15, 2012 at 19:37 | comment | added | Suresh | Well, the view in the paper that Artem links to is that these are all manifestations of a single category-theoretic fact. | |
| Mar 15, 2012 at 18:11 | comment | added | Raphael | This is a connection based on similarity of proofs, rather than implications between the results, isn't it? | |
| Mar 15, 2012 at 18:03 | comment | added | Artem Kaznatcheev | this paper is not mentioned in the cstheory answer (but is in the comments of Andrej Bauer's blog post from the answer), but is probably a good overview as well. | |
| Mar 15, 2012 at 17:19 | history | edited | Shog9 | CC BY-SA 3.0 |
prettify link
|
| Mar 15, 2012 at 16:51 | history | answered | Suresh | CC BY-SA 3.0 |