Timeline for Robbers: Smallest subset of characters required for Turing Completeness
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2022 at 14:20 | comment | added | Dominic van Essen | The exact solution that I had in mind worked on TIO, so I may be able to adjust it and re-post another cop... | |
| May 20, 2022 at 14:09 | comment | added | Cong Chen | Thanks! Were you thinking of a different infix function? | |
| May 20, 2022 at 14:08 | comment | added | Dominic van Essen | Well done. Using the -> assignment operator to define infix function was exactly the trick that I had in mind. I still can't think of a way to ban (=<>, so possibly that's an impossible-to-crack 'sort-of-cop'... | |
| May 20, 2022 at 13:32 | history | edited | Cong Chen | CC BY-SA 4.0 | added 97 characters in body |
| May 20, 2022 at 13:27 | history | answered | Cong Chen | CC BY-SA 4.0 |