Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2021 at 23:06 | comment | added | Beefster | @Bubbler feeding a step's output into its own input is not allowed, so yes, that probably wouldn't work. Basically, the idea is that you could run this as a bash pipeline and no matter what the input sequence is, you wouldn't be able to remove any subset of steps and have it still work. | |
| Apr 4, 2021 at 23:31 | comment | added | Bubbler | So a recursive approach (e.g. one similar to Stooge sort) is a no-starter? | |
| Apr 1, 2021 at 19:13 | comment | added | Beefster | Throwing in a randomizer step probably wouldn't be irreducible. | |
| Apr 1, 2021 at 18:17 | comment | added | water_ghosts | Does the process have to be deterministic (e.g. no implementation of bogosort)? I think your rules imply that, but it might be good to state explicitly. | |
| Apr 1, 2021 at 16:33 | comment | added | Beefster | I suspect there's a way to have an arbitrarily complicated sequence of programs as well and I'm not quite sure how to limit that, aside from performance (the 30 minute rule) | |
| Apr 1, 2021 at 16:30 | comment | added | rydwolf | What is there to put an upper bound on the size, other than irreducibility? I'm almost certain there's a way to get an infinite score pretty trivially. | |
| Apr 1, 2021 at 16:10 | history | answered | Beefster | CC BY-SA 4.0 |