By comparison, the early Sanger (et al) sequencing papers were field founding - they started a field - but not field finding, since it was obvious for many years prior that sequencing DNA (or RNA) was a good idea. Sanger et al were the first to really figure out how to do it.
-
Show this thread
-
Obviously, the distinction isn't black & white. Eg in Turing's case you can argue that the problem of developing a notion of effective computation was implicit in earlier work (eg Hilbert). But Turing understood the big picture problem superbly, & made it obvious this was a field
1 reply 3 retweets 19 likesShow this thread -
I've seen and heard lots of discussion of field founding, usually in a Sanger-like context: figuring out how to make progress on big problems that are more or less obvious to everyone.
1 reply 1 retweet 10 likesShow this thread -
But I've heard very, very little about field finding. And I believe field finders are (a) incredibly valuable for science; and (b) dramatically undervalued by existing institutions.
6 replies 10 retweets 58 likesShow this thread -
It's surprisingly hard to think of a field finding paper that was supported by a grant. It's a case where you by definition _can't_ make a strong prior argument for the work; in fact, the whole job is to figure out the basic concepts that will make such an argument even possible
2 replies 8 retweets 47 likesShow this thread -
Eg you can't motivate the founding paper of computer science by referring to some prior notion of how important computers are; you're actually trying to invent the notion of computers, & argue for its importance.
3 replies 1 retweet 19 likesShow this thread -
When such papers were supported by a grant, it was always for something very different, AFAIK.
1 reply 0 retweets 10 likesShow this thread -
Such papers often argue on very fundamental grounds. Consider this line of argument, which, taken sufficiently seriously, leads to quantum computers (and, possibly, other notions of computation). From
@DavidDeutschOxf's https://people.eecs.berkeley.edu/~christos/classics/Deutsch_quantum_theory.pdf …pic.twitter.com/ONMdskU3Iy
1 reply 2 retweets 28 likesShow this thread -
It's striking that very, very few later papers on quantum computing take these questions seriously. They instead take the notion of quantum computing as given, and ask questions about that notion. But that wasn't possible in the early 1980s.
3 replies 1 retweet 12 likesShow this thread -
Replying to @michael_nielsen
QM is slightly hypercomputational. If QM turns out to be ontologically correct, in the sense that we live in a universe that can factor large numbers efficiently, then the Church Turing Thesis is wrong. I am willing to bet against that...
2 replies 0 retweets 1 like
Quantum computers obey the Church-Turing thesis. I guess you're thinking of the possibility they violate the strong Church-Turing thesis. (Side note: we have no proof factoring is hard on conventional computers. I wouldn't be hugely surprised if it's not.)
-
-
Replying to @michael_nielsen
Exactly. Now the interesting question is if there is a class of problems that our universe can solve efficiently but classical computers cannot.
0 replies 0 retweets 2 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.