Timeline for Caddyshack or: How to compress already-golfed code
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 13, 2020 at 1:19 | comment | added | Dustin G. Mixon |
@tom - I'm not so picky about s . A set of bytes with values of 0-255 will suffice for this challenge.
|
|
Jan 13, 2020 at 1:03 | comment | added | tom |
I have a question about the string s - can it be effectively binary - a set of bytes with values of 0-255 - or should it be restricted to 'bytes that can be printed'. Is it envisioned that s can be printed as 'code ' in a Code-Golf post? Do you have a list of characters we should not use? Oh and great challenge.
|
|
Jan 11, 2020 at 23:11 | comment | added | Dustin G. Mixon | @a'_' - If there's a program E that converts from JavaScript to Japt, then it's valid, yes. | |
Jan 11, 2020 at 14:46 | comment | added | user85052 | Is Japt a valid caddie for JavaScript? | |
Jan 9, 2020 at 21:12 | answer | added | sugarfi | timeline score: 2 | |
Jan 9, 2020 at 1:13 | comment | added | Dustin G. Mixon | @sugarfi - D is designed with E, for E. One possibility is that D uncompresses s to obtain c and then evaluates c on input x. Yes, this conversion from s to c can be thought of as the inverse of E. | |
Jan 9, 2020 at 1:08 | comment | added | sugarfi | I am a bit confused about "The program D takes s as input along with any input x of c and returns the output of c(x)." Does this just mean that D is the inverse of E? Or does D have to work for any caddy? | |
Jan 4, 2020 at 13:45 | comment | added | user9207 | This is a very nice question imho. | |
Jan 3, 2020 at 12:00 | history | tweeted | twitter.com/StackCodeGolf/status/1213067641830674433 | ||
Jan 2, 2020 at 20:26 | history | asked | Dustin G. Mixon | CC BY-SA 4.0 |