Timeline for Turing machine for $0^{3^k} 1^{p}$
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2021 at 7:41 | history | edited | Mihai Chirculete | CC BY-SA 4.0 |
Corrected title
|
| Apr 18, 2021 at 7:40 | vote | accept | Mihai Chirculete | ||
| Apr 17, 2021 at 12:16 | answer | added | user6530 | timeline score: 4 | |
| Apr 17, 2021 at 10:49 | answer | added | Rodion Zaytsev | timeline score: 4 | |
| Apr 17, 2021 at 10:42 | review | First posts | |||
| Apr 18, 2021 at 21:31 | |||||
| Apr 17, 2021 at 10:41 | comment | added | Yuval Filmus | Start by coming up with a Turing machine that uses linear space. You can convert it into an in-place Turing machine which simulates multiple tapes on a single tape by enlarging the alphabet. | |
| Apr 17, 2021 at 10:40 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
deleted 86 characters in body; edited title
|
| Apr 17, 2021 at 10:22 | history | asked | Mihai Chirculete | CC BY-SA 4.0 |