7 ms·
There's a number of Numberphile videos I've seen where there are computer checks being done on various conjectures famous enough to on a video series like Numbe
by jerf 8y ago
There's a number of Numberphile videos I've seen where there are computer checks being done on various conjectures famous enough to on a video series like Numberphile, and even IIRC one case where a counterexample was found by an amateur with a computer. I've often thought there must be a lot of much less famous conjectures that are probably something an amateur with a computer could attack, and could well be the first to try. Or be the first one to try with gigabytes and teraflops, if the last person tried in an era where "kilo" still sounded pretty impressive.
Math is well covered, but the frontier is larger than ever; it grows every day. There's just a certain art to finding them.
Another field I've wondered about that may be relevant to HN interests is quantum algorithms. There's a lot of very smart people working the theory and the engineering and such, but I wouldn't be all that surprised there's a lot of room for even a relative amateur to learn about what quantum computers can do, and find practical speedups to existing problems, not because nobody is trying but because the field of existing problems is just so large that there almost has to be low hanging fruit still available. Theorists right now are mostly interested in solutions that change O() classes, but someone just having some fun will care if they can find a 100x speedup that is technically not in a different O() class, or something like that.
- dekhn 8y agoAs for Conjectures: I tried one of them (http://norvig.com/beal.html http://norvig.com/beal.html) but didn't have any luck (see the part just before the Conclusion). Like Peter says, better spend your brainpower on a proof than your computerpower on finding counterexamples. It didn't need a subject domain expert- just computer engineers who understood the problem and how to test counterexamples efficiently.