Timeline for Fewest (distinct) characters for Turing Completeness
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2017 at 14:59 | comment | added | user62131 | Ah right. That doesn't affect Turing-completeness, of course (because an infinite loop that doesn't change the internal state can't contribute to a program's computational class). | |
| Feb 21, 2017 at 13:23 | comment | added | Martin Ender | "Thue programs continue running until no more substitutions are possible, and this causes the Retina to work the same way" with the only exception that Retina will terminate early if one pass through the entire program fails to change the string. So you even get some simple infinite-loop detection for free. | |
| Feb 21, 2017 at 4:58 | history | answered | user62131 | CC BY-SA 3.0 |