Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2018 at 12:02 | comment | added | user202729 | Do you think this would be better here or on Puzzling? | |
| Sep 30, 2018 at 7:26 | history | edited | Bubbler | CC BY-SA 4.0 | added 1271 characters in body |
| Sep 6, 2018 at 23:38 | history | edited | Bubbler | CC BY-SA 4.0 | added 352 characters in body |
| Jul 25, 2018 at 23:02 | history | edited | Bubbler | CC BY-SA 4.0 | added 73 characters in body |
| Jul 24, 2018 at 7:00 | history | edited | Bubbler | CC BY-SA 4.0 | added 201 characters in body |
| Jul 23, 2018 at 11:49 | comment | added | Peter Taylor | (In fact I've spotted one unnecessary intersection, so 15). | |
| Jul 23, 2018 at 11:38 | comment | added | Peter Taylor | On the difficulty of the given theorem: without much effort (5 minutes maximum) I have a solution scoring 16. It's certainly much easier than the existing proof-golf questions to get an answer, although I can believe that there may still be room to golf my solution. | |
| Jul 23, 2018 at 11:35 | comment | added | Peter Taylor | I think it would be a stretch to consider this on-topic: proofs in logic can be argued to be as good as programs by reference to the Curry-Howard correspondence, but I don't really see extending that to proofs in general. It might be more interesting to instead ask for a program which generates proofs and score by the length of the generated proofs (although since the linked paper talks about a 6000-line program to search for them, that may be outside the scope of a reasonable PPCG challenge). | |
| Jul 23, 2018 at 5:53 | history | answered | Bubbler | CC BY-SA 4.0 |