Timeline for Is there any space(n) complete language?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2010 at 21:47 | comment | added | slimton | This is meant to be a comment on Kristoffer's answer below but I don't have enough reputation to place it there. The comment is that it seems to me that the tape-compression theorem, which you invoke to turn every machine to one with a single work-tape and a fixed alphabet, works precisely by increasing the alphabet or the number of work-tapes; or does it? | |
| Sep 26, 2010 at 8:21 | history | answered | slimton | CC BY-SA 2.5 |