Timeline for Nondeterministic Turing machines and the recursion theorem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2013 at 19:35 | vote | accept | Noah Schweber | ||
| Oct 19, 2013 at 14:32 | answer | added | Michal R. Przybylek | timeline score: 7 | |
| Oct 19, 2013 at 1:06 | comment | added | Noah Schweber | Oh, I see! Somehow I missed that. If you post your comment as an answer, I'll accept it. | |
| Oct 18, 2013 at 22:47 | comment | added | Michal R. Przybylek | By "computable" he means can be computed "by value". See the last paragraph on the previous page. | |
| Oct 18, 2013 at 22:01 | history | asked | Noah Schweber | CC BY-SA 3.0 |