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
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2012 at 22:24 | comment | added | Yonatan N | For sufficiently nonconstant f(n). | |
| Mar 15, 2012 at 18:06 | history | answered | jmad | CC BY-SA 3.0 |