Timeline for Fewest (distinct) characters for Turing Completeness
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2021 at 8:04 | history | edited | Grimmy | CC BY-SA 4.0 |
added 36 characters in body
|
| Dec 13, 2017 at 9:18 | history | edited | Grimmy | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jun 6, 2017 at 16:57 | history | bounty ended | CommunityBot | ||
| Jun 4, 2017 at 17:05 | history | edited | Grimmy | CC BY-SA 3.0 |
added 1388 characters in body
|
| Jun 4, 2017 at 3:59 | comment | added | CalculatorFeline | Request: Explain this "slightly different approach" | |
| Jun 3, 2017 at 4:34 | comment | added | Ørjan Johansen | You can make that shrinked example a TIO link Try it online! | |
| Jun 2, 2017 at 15:06 | history | edited | Grimmy | CC BY-SA 3.0 |
added 267 characters in body
|
| Jun 2, 2017 at 7:02 | comment | added | Grimmy | @ØrjanJohansen Yep, good job spotting that. I’m working on a solution right now. | |
| Jun 2, 2017 at 4:33 | comment | added | Ørjan Johansen |
I see.. your encoding gets a quadratic blowup because your characters divide into two groups, one that can only be produced by xor'ing an even number of base characters, and another that can only be produced by an odd number, forcing you to add another glob whenever changing between them. Any chance you could divide the program into shorter evaluable pieces tied together with ^ or other base characters?
|
|
| Jun 1, 2017 at 18:52 | history | edited | Grimmy | CC BY-SA 3.0 |
added 218 characters in body
|
| Jun 1, 2017 at 18:44 | history | answered | Grimmy | CC BY-SA 3.0 |