Timeline for Max number of configurations of a Turing Machine
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2019 at 20:59 | vote | accept | Johnny Pandeleo | ||
| Feb 20, 2019 at 20:59 | vote | accept | Johnny Pandeleo | ||
| Feb 20, 2019 at 20:59 | |||||
| Feb 20, 2019 at 19:43 | comment | added | D.W.♦ | @JohnnyPandeleo, yup! You got it. The tape alphabet is fixed and doesn't vary depending on the length of the input, which is why $|\Gamma|$ is a constant. | |
| Feb 20, 2019 at 11:44 | comment | added | Johnny Pandeleo | Oh ok, this makes sense. So we can essentially represent an arbitrary tape alphabet size, $\vert \Gamma \vert$ with some constant so that $2^c = \vert \Gamma \vert$. thank you! | |
| Feb 19, 2019 at 20:51 | history | answered | D.W.♦ | CC BY-SA 4.0 |