Timeline for Sums of square roots
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2021 at 16:59 | comment | added | Dominic van Essen | Let us continue this discussion in chat. | |
| Jun 9, 2021 at 16:54 | comment | added | Makonede |
@DominicvanEssen The second one has an extra 5, actually. Look closely.
|
|
| Jun 9, 2021 at 16:52 | comment | added | Dominic van Essen | But I think you may have a more severe problem: TLætOê seems to output 7.181540550352055 twice, suggesting to me that 05AB1E is subject to floating-point inaccuracies that are forbidden here... | |
| Jun 9, 2021 at 16:52 | comment | added | Makonede | @DominicvanEssen Think what you think, this is valid. | |
| Jun 9, 2021 at 16:50 | comment | added | Dominic van Essen | Well, I still don't agree that a program that provably never outputs anything is valid, even if a different version of the program can output something. I think that it would be better to modify the runnable version to output the k-th (or 1-to-kth) element(s), even if this costs a byte or two more. | |
| Jun 9, 2021 at 16:40 | comment | added | Makonede |
@DominicvanEssen codegolf.meta.stackexchange.com/a/12949/94066. if you try it with something smaller, say TL instead of ∞, it outputs a portion of the sequence. with something bigger like ₁L, it outputs a larger portion. therefore given infinite resources, it will eventually begin to output the list
|
|
| Jun 9, 2021 at 16:35 | comment | added | Dominic van Essen | I don't think this justifies a program that doesn't ever output anything. Your link refers to the question "Should programs that are not proven to always terminate be valid?", and specifically considers the situation of programs that do terminate for almost all situations. Your program could be proven to never terminate, ever. | |
| Jun 9, 2021 at 16:16 | comment | added | Makonede | @DominicvanEssen codegolf.meta.stackexchange.com/a/10582/94066 | |
| Jun 9, 2021 at 9:41 | comment | added | Dominic van Essen | I'm not convinced that a program that never outputs anything can be considered a valid answer. It would be Ok if it outputs the sequence gradually (and so takes forever to finish), but the strategy of 'sorting' an infinite sequence (that obviously can't ever work) seems a bit dubious to me... | |
| Jun 8, 2021 at 23:15 | history | answered | Makonede | CC BY-SA 4.0 |