Timeline for Fewest (distinct) characters for Turing Completeness
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19 at 16:58 | history | edited | ceilingcat | CC BY-SA 4.0 | added 331 characters in body |
| S Feb 13, 2023 at 3:11 | history | suggested | Wyatt Carpenter | CC BY-SA 4.0 | the code uses [] and not (). That's really my only substantive change, but since "edits must be at least 6 characters", I also made the explanation of the form of the 1+1+1 constraints not imply that they all have to be single 1 digits. |
| Feb 13, 2023 at 2:58 | review | Suggested edits | |||
| S Feb 13, 2023 at 3:11 | |||||
| Sep 17, 2020 at 10:45 | history | edited | ceilingcat | CC BY-SA 4.0 | deleted 3679 characters in body |
| Sep 10, 2020 at 5:58 | history | edited | ceilingcat | CC BY-SA 4.0 | added 5814 characters in body |
| Sep 10, 2020 at 1:43 | comment | added | Bubbler | Update: $=1+; is enough to simulate all possible programs | |
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Mar 23, 2019 at 0:20 | history | edited | ceilingcat | CC BY-SA 4.0 | add TIO link |
| Feb 23, 2017 at 19:18 | comment | added | John Bollinger | @wizzwizz4, it's not pure C in any case, not in any sense that makes it Turing complete. It has no C semantics whatever. Since you're anyway relying on compiler and execution environment details to get anything runnable at all, you might as well allow for an arbitrarily-named entry point. | |
| Feb 22, 2017 at 19:48 | comment | added | wizzwizz4 | @IllusiveBrian For [compilername -flagsrequired], yes. But that's not "pure" C (although few if any implementations are!). | |
| Feb 22, 2017 at 19:21 | comment | added | IllusiveBrian | I'm not sure if it is against the challenge rules, but couldn't you define a custom entry point for the program when it's compiled and drop imn? | |
| Feb 22, 2017 at 19:18 | comment | added | ceilingcat | @GB I just realized a shorter representation of 0 is 1==11 | |
| Feb 22, 2017 at 18:33 | history | edited | ceilingcat | CC BY-SA 3.0 | Added remark about tcc, shortened hello world example |
| Feb 22, 2017 at 14:31 | comment | added | Dennis | tcc lets you get away without const. tio.run/nexus/… | |
| Feb 22, 2017 at 10:51 | comment | added | ceilingcat | @schnaader "Runtime error" is because I didn't bother to clear %eax before exiting. | |
| Feb 22, 2017 at 10:37 | comment | added | schnaader | Gives a runtime error on ideone, but the desired output on stdout :) | |
| Feb 22, 2017 at 9:41 | comment | added | ceilingcat | @GB On a machine with 32 bit ints 0==1111111111+1111111111+1111111111+111111111+111111111+111111111+111111111+111111111+111111111+111111111+111111111+11111111+11111111+11111111+11111111+11111111+11111111+1111111+1111111+1111111+1111111+1111111+111111+111111+111111+111111+11111+11111+11111+11111+11111+11111+11111+111+111+111+111+111+11+11+11+11+11+11+11+1 | |
| Feb 22, 2017 at 9:39 | comment | added | user62131 | @GB: Zero's fairly easy to avoid using in at least x86 machine code (it's not a terribly important instruction), especially because the problem only happens if you have four zero bytes in a row. | |
| Feb 22, 2017 at 9:31 | history | edited | ceilingcat | CC BY-SA 3.0 | added 4623 characters in body |
| Feb 22, 2017 at 7:40 | comment | added | G B | Cool, but how do you generate zero? I would use '-' instead of '+'. | |
| Feb 21, 2017 at 21:15 | history | edited | ceilingcat | CC BY-SA 3.0 | added 75 characters in body |
| Feb 21, 2017 at 21:06 | history | answered | ceilingcat | CC BY-SA 3.0 |