4 ms·
I get the e-mail for the EFF Cooperative Computing Awards https://www.eff.org/awards/coop https://www.eff.org/awards/coop so, despite having put lots of effor
by schoen 10y ago
I get the e-mail for the EFF Cooperative Computing Awards
https://www.eff.org/awards/coop https://www.eff.org/awards/coop
so, despite having put lots of effort into not having people make spurious claims, I hear from a whole lot of math cranks.
Two things that I find striking are many people's level of confidence that they can personally "solve the problem" (in this case, by inventing some kind of "formula for primes" that has eluded the organized mathematics world for decades), and many people's lack of understanding of what a solution would consist of (in terms of knowing that mathematical proofs exist, and being able to understand whether they have a theorem or just a conjecture).
Our situation is especially tricky because we chose a problem that experts said would require lots of computational resources and couldn't be solved by new mathematical insight, but then we didn't outright forbid people from trying to solve it by insight. So a lot of people see an exciting challenge, like "they think it will take a lot of computer time, but if I can just see the pattern, I can skip all of that!". Also, we have a large monetary reward for solutions and so people are excited by the idea that they have them and are about to receive a bunch of money.
I think it's true that many of the people who contact me about this are excited about mathematics in the way that people who contacted Dr. Hossenfelder were excited about physics (and, as pdkl95 said, that Carl Sagan's cab driver was excited about science). But it's still frustrating that, after we've gone to some lengths to say that you need a proof and not just a guess, and that decades of research indicate that you can't find primes of this size without significant computer time, people are still so confident that their guesses are right and so resistant to accepting that they haven't met the awards criteria.
It would be interesting to see an equivalent service for talking to mathematicians and to see what some of the people who contact us might get out of it, and whether it might inspire them to pursue more constructive things. (I always wish that our awards would motivate someone to start doing Project Euler problems or something...) If someone set up that "talk to a mathematician" service, I would probably try to send lots of people their way.
- drauh 10y agoOh god. "Formula for primes" - I was involved in a way too long forum discussion where everyone involved was trying to convince the guy putting forth his idea for generating primes that he was merely going round in circles, proving and reproving identities. As a former physicist, I think that math is way harder to talk about to laypeople, though there can be a wide variation in difficulty by subfield. Maybe number theory can be accessible, but analysis, say, would be pretty opaque. Not to mention some of the more exotic branches of math.
- schoen 10y agoI've unfortunately received somewhere around 100 supposed formulas for primes in the past decade and a half. :-( There's a great Wikipedia article about this: https://en.wikipedia.org/wiki/Formula_for_primes https://en.wikipedia.org/wiki/Formula_for_primes But most of what people send me is along the lines of "numbers containing only odd digits, that don't end in 5" or "4k+1 for any k, if it contains only odd digits", or "(p-1)²+7 for any prime p" or whatever. A kind of unfortunate example was an elementary school girl who became convinced that numbers containing only odd digits are always prime (many people are tempted by some form of this idea), and spent several weeks writing such digits down in a composition notebook in order to form an integer that would be big enough to qualify for one of our awards.
- deleted 10y ago[deleted]
- pklausler 10y agoAnd the counterexample of 15 didn't work?
- duaneb 10y agoOr 9.
- pklausler 10y agoAh. I took "digits" to mean "must be plural", not "could be".
- schoen 10y agoI've come up with counterexamples for every such formula or rule that people have sent me (usually running a Python loop with gmpy2.is_prime() or something), but unfortunately the existence of the counterexamples somehow didn't occur to them before they wrote in in the first place. https://en.wikipedia.org/wiki/Mathematical_coincidence https://en.wikipedia.org/wiki/Mathematical_coincidence is a big problem because people will sometimes conjecture a pattern and then find that it holds for 6 or 7 integers and conclude that it's right. Or if they find a counterexample, they might just make a minimal modification to the conjecture and conclude that they're fixed it! So there are lots of these that will say "unless the number is..." and presumably give some other random property that the counterexample that the claimant found had. It feels like some people think that mathematics works by people guessing rules and then checking them, and regarding the rules as right if they "check out" in practice. (I know that there's been lots of progress made from guesses and conjectures and numerical experiments; the issue is just what comes after the guess!)
- deleted 10y ago[deleted]
- dredmorbius 10y agoThis raises the meta-question of how best to run filters for possibly-interesting-but-expensive-to-assess claims, posts, and traffic. One model I've heard of is to put the cranks in contact with each other, which at least offloads the problem. I'm not sure it's an effective filtering mechanism, however. This is related to the general problem of innovation (in maths or otherwise), in which the view that inventors simply toss ideas out at random but the good inventors are far better at sussing out the good ideas and rejecting bad ones may hold some validity. See J. Doyne Farmer, John Muth (whom Farmer cites: John F. Muth, (1986) Search Theory and the Manufacturing Progress Function. Management Science 32(8):948-962. http:// http:// dx.doi.org/10.1287/mnsc.32.8.948), John Holland, etc. There are implications for online collaborative filtering, both in general discussions (e.g., HN) and academic publishing (e.g., PLOS ONE).
- schoen 10y ago> put the cranks in contact with each other Three Cranks of Ypsilanti, so to speak?
- dredmorbius 10y agoNot familiar with the reference. I think Feynman may have used this technique though. More seriously, I was hoping you'd pick up on the overarching theme: is there an effective way to sort through the autodidact chaff to find wheat? My own area of crankdom is economic theory. I have (and I believe this earns me John Baez crank points) studied the topic in school, and am doing a boatload of research on both current state and history of theory and the dynamics of its spread. Interesting stuff. I'm actively trying to shut the fuck up for the most part, other than 1) noting what I'm currently pursuing, 2) questions of interest, 3) references of interest (e.g., the Santa Fe Institute mafia generally, mentioned above), and 4). occasionally contacting specific academics with specific questions, usually about some element of theory, historical item, etc., rather than a full-fledged Theory of Everything. Then withdraw for further mulling. I'm batting about 50-50 on responses, some quite helpful. But it does put to mind the question of how one ought approach questions quite fundamental to the nature of a large field of study and/or propaganda (economics is ... curious in many regards).