Timeline for Print a Tabula Recta!
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2019 at 14:07 | comment | added | ghosts_in_the_code | Regarding complexity class, shouldn't the problem be undecidable since /// is Turing complete? The problem is "given a string, find the shortest /// program that outputs it". Except for small strings, there would exist /// programs that loop indefinitely (but cannot be proven to loop indefinitely) that cannot be shown to not produce the desired output without running them forever. Formal proof I'm myself not sure yet but intuitively isn't it possible? | |
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot | replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/ | |
| Aug 2, 2016 at 7:31 | history | edited | Martin Ender | CC BY-SA 3.0 | added 82 characters in body |
| Aug 1, 2016 at 8:51 | comment | added | Erik the Outgolfer | My answer is gone, it was a dupe of this (bigger and later). +1 for that [incredible golfing]! | |
| Jul 31, 2016 at 14:42 | history | edited | Martin Ender | CC BY-SA 3.0 | added 71 characters in body |
| Jul 31, 2016 at 11:13 | comment | added | Martin Ender | @GeorgeGibson Thanks... I had to start over halfway through when I noticed a certain YX in the output. ;) | |
| Jul 31, 2016 at 11:12 | comment | added | user53406 | That... is... brilliant... | |
| Jul 31, 2016 at 11:06 | history | answered | Martin Ender | CC BY-SA 3.0 |