Timeline for Goldbach's conjecture algorithm
Current License: CC BY-SA 4.0
22 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 13 at 8:24 | comment | added | greybeard | Does this procedure allow to observe any effect with regard to the conjecture? | |
Jun 27, 2023 at 19:18 | answer | added | Andy Richter | timeline score: 2 | |
Feb 21, 2019 at 18:01 | history | tweeted | twitter.com/StackCodeReview/status/1098643803353829376 | ||
Feb 14, 2019 at 4:02 | history | edited | Jamal | CC BY-SA 4.0 |
deleted 3 characters in body; edited title
|
Feb 13, 2019 at 23:57 | answer | added | gnasher729 | timeline score: 4 | |
Feb 13, 2019 at 20:31 | comment | added | Vortico | @MikeTheLiar I know he knows, but someone reading his comment may be misled. It's bad advice to recommend to a programming beginner to change the tool he's learning before even pointing out the issue with his algorithm. It's discouraging, doesn't solve the problem at hand (because maybe his goal is to simply learn Python, and remember this is a code review community), and doesn't teach how to think on one's own. It's not "The first problem" with his code as he said. It's the 26th or maybe 126th problem he should worry about while playing around with Goldbach's conjecture. | |
Feb 13, 2019 at 19:57 | comment | added | User1000547 | @Vortico are you seriously lecturing Eric Lippert on performance gains and optimization? | |
Feb 13, 2019 at 18:11 | comment | added | Eric Lippert | @Vortico: Of course; if there are algorithmic wins here then take them. But if the problem comes down to "addition and equality is too slow" then algorithmic wins are no longer going to help. | |
Feb 13, 2019 at 18:10 | comment | added | Vortico | @EricLippert Don't worry about language/compiler/interpreter optimization before you do mathematical/complexity optimization first. Switching languages can only improve performance by a small factor (1-10). Changing the algorithm can give speedups of 1-infinity. | |
Feb 13, 2019 at 17:23 | comment | added | Eric Lippert | The first problem is that you're trying to get speed out of arithmetic in Python; that's a losing proposition. Python has many strengths, and speed of basic arithmetic is not one of them. Running your code in an optimizing Python runtime will help considerably, but if you have heavy-duty computations to perform, picking a language that compiles arithmetic down closer to the metal will help enormously. | |
S Feb 13, 2019 at 15:28 | history | suggested | Glorfindel | CC BY-SA 4.0 |
typo in title corrected
|
Feb 13, 2019 at 15:00 | review | Suggested edits | |||
S Feb 13, 2019 at 15:28 | |||||
Feb 13, 2019 at 14:03 | comment | added | Kevin | Sorry for that, I'm a new programmer and didn't know what profiling is! | |
Feb 13, 2019 at 13:47 | comment | added | Graipher | It is a debugging technique that tells you how much time is spent in which part of your code: docs.python.org/3/library/debug.html | |
Feb 13, 2019 at 13:46 | comment | added | Kevin | Profiled? What do you mean? | |
Feb 13, 2019 at 8:55 | review | Close votes | |||
Feb 13, 2019 at 22:58 | |||||
Feb 13, 2019 at 8:44 | answer | added | Josiah | timeline score: 11 | |
Feb 13, 2019 at 8:37 | answer | added | Graipher | timeline score: 25 | |
Feb 13, 2019 at 8:23 | comment | added | Graipher |
Have you profiled this? How is primenums implemented?
|
|
Feb 13, 2019 at 8:20 | history | edited | Graipher | CC BY-SA 4.0 |
Add link to wiki page, fix some typos, use "," as thousand separator instead of "."
|
Feb 13, 2019 at 8:20 | review | First posts | |||
Feb 13, 2019 at 8:57 | |||||
Feb 13, 2019 at 8:17 | history | asked | Kevin | CC BY-SA 4.0 |