Timeline for Is the Shakespeare Programming Language Turing complete?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2019 at 20:40 | vote | accept | vesii | ||
| Feb 23, 2019 at 11:39 | answer | added | chi | timeline score: 4 | |
| Feb 23, 2019 at 9:33 | comment | added | Discrete lizard♦ | Loops in Shakespeare can be created with gotos. | |
| Feb 23, 2019 at 9:04 | history | edited | reinierpost | CC BY-SA 4.0 |
fix tutle, interpunction and capitalization
|
| Feb 23, 2019 at 4:11 | comment | added | Evil | Have you seen: cs.stackexchange.com/questions/2832/… ? In given language you declare number of stacks to use, two will suffice. There are conditionals and goto instructions, so there are loops. | |
| Feb 23, 2019 at 2:14 | history | edited | John L. | CC BY-SA 4.0 |
Added a reference to the language.
|
| Feb 23, 2019 at 0:42 | history | asked | vesii | CC BY-SA 4.0 |