Timeline for Looking for an example of proving space upper bounds for computing functions on a DTM
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2015 at 22:05 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 4 characters in body; edited title
|
| Feb 2, 2015 at 22:05 | answer | added | Yuval Filmus | timeline score: 1 | |
| Feb 2, 2015 at 22:05 | comment | added | Yuval Filmus | Squaring doesn't take constant time on a Turing machine. | |
| Feb 2, 2015 at 21:47 | history | asked | user6818 | CC BY-SA 3.0 |