Timeline for Lower Bounds in Theoretical Computer Science
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2012 at 7:18 | history | made wiki | Post Made Community Wiki by S. Carnahan♦ | ||
| Jul 23, 2010 at 20:26 | comment | added | Kaveh | You can find the proof in the second volume of "Classical Recursion Theory". | |
| Jul 11, 2010 at 21:27 | comment | added | Antonio E. Porreca | I’ve always found this result fascinating: less than log log n tape is no better than no tape at all. | |
| Jul 11, 2010 at 18:48 | history | answered | Akhil Mathew | CC BY-SA 2.5 |