Sewing-Machine comments on Harry Potter and the Methods of Rationality discussion thread, part 8 - 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 (653)
I'm mostly with you.
These feasibility issues are definitely interesting. Another possibility is that there is a formal proof of feasible length, but no feasible search will ever turn it up. (Well, unless P = NP). Yet another possibility is that a feasible search will turn it up, I certainly regard it as more likely than most people do.
I agree that this counts as evidence, but it's possible to overestimate it. Foundational issues hardly ever come up in everyday mathematics, so the fact that people are able to prove astonishing things about 3-manifolds without running into contradictions I regard as very weak evidence in favor of ZF. There have been a lot of man-hours put into set theory, but I think quite a bit less than have been put into other parts of math.
JoshuaZ and I had a discussion about this a while ago, starting here.
This reminds me of people who argue that, because P != NP, we will never prove this. (The key to the argument, IIRC, is that any proof of this fact will have very high algorithmic complexity.) I'm not sure how to find this argument now. (There is something like it one of Doron Zeilberger's April Fools opinions.)
Yes, these results should be formalisable in higher-order arithmetic (indeed nth order for n a single-digit number). It is the set theorists' work with large cardinals and the like that provides the only real evidence for the consistency of such a high-powered system as ZF.