Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2021 at 0:23 | history | undeleted | caird coinheringaahingMod | ||
| Oct 20, 2020 at 20:36 | history | deleted | caird coinheringaahingMod | via Vote | |
| Oct 20, 2020 at 20:36 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | deleted 3399 characters in body |
| Oct 20, 2020 at 20:00 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | added 404 characters in body |
| Oct 4, 2020 at 20:58 | comment | added | caird coinheringaahing Mod | @LuisMendo I've edited in "It is acceptable if your program fails for some inputs due to floating point issues, so long as the underlying algorithm or method works for arbitrary matrices." which I think should cover both of those points | |
| Oct 4, 2020 at 20:56 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | added 162 characters in body |
| Oct 2, 2020 at 23:18 | comment | added | Luis Mendo | Also, matrix inversion notoriously causes floating-point error build-up when naïve algorithms (i.e. algorithms not specifically designed to avoid error accumulation) are used. This results in relatively large errors in the output. And those algorithms are likely to be the ones used in a golfing challenge (if the language doesn't have a builtin). So maybe you should add a note saying that it is sufficient if the algorithm works when arbitrary precision is assumed | |
| Oct 2, 2020 at 23:18 | comment | added | Luis Mendo | n , nor n2, will never exceed the maximum value... and The elements of M−1 will never exceed... Even under those assumptions, intermediate computations can exceed the maximum. So maybe it's better to say something more general, maybe along the lines of this | |
| Oct 2, 2020 at 0:20 | history | answered | caird coinheringaahingMod | CC BY-SA 4.0 |