komponisto comments on Which fields of learning have clarified your thinking? How and why? - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (64)
Like I suspected, this is rife with confusion-of-levels.
That's like saying that you can get through life without knowing about atoms more easily than you can without knowing about animals, and so biology must be more fundamental than physics. Completely the wrong sense of the word "fundamental".
This is a classic confusion of levels. It's the same mistake Eliezer makes when he allows himself to talk about "seeing" cardinal numbers, and when people say that special relativity disproves Euclidean geometry, or that quantum mechanics disproves classical logic.
Your conception of "differential equations" is probably too narrow for this to be true. Consider where set theory came from: Cantor was studying Fourier series, which are important in differential equations.
...and nor does the reduction of biology to physics "illuminate" human behavior. That just isn't the point!
Nope. It is literally possible to reduce the theory of Turing machines to real analytic ODEs. These can be modeled without set theory.
Okay, that sounds interesting (reference?), but what about the rest of my comment?
Here is Pour-El and Richards. Here is a more recent reference that makes my claim more explicitly. Both are gated.
I'm not sure what to say. You've accused me of "confusing levels," but I'm exactly disputing the idea that sets are at a lower level than real numbers. Maybe I know how to address this:
I don't know about human behavior, which isn't much illuminated by any subject at all. But the reduction of biology to physics absolutely does illuminate biology. Here's Feynman in six easy pieces:
You simply can't say the same thing -- even hyperbolically -- about the set-theoretic idea that everything in math is a set, made up of other sets.
Matiyasevich's book "Hilbert's 10th Problem" sketches out one way to do this.
Hilbert's 10th problem is about polynomial equations in integer numbers. This is a vastly different thing.
Yes, Hilbert's 10th Problem was whether there was an algorithm for solving whether a given Diophantine equation has solutions over the integers. The answer turned out to be "no" and the proof (which took many years) in some sense amounted to showing that one could for any Turing machine and starting tape make a Diophantine equation that has a solution iff the Turing machine halts in an accepting state. Some of the results and techniques for doing that can be used to show that other classes of problems can model Turing machines, and that's the context that Matiyasevich discusses it.