I'm sorry, but that's just naive techno-solutionism. Maybe the computer will be able to solve your syntax problems, i.e., write proofs. It will never know anything about the semantics.
Said differently. Maybe the computer will be able to give you a proof on demand on statement number 123456789 in some Gödel numbering of statements. What it won't be able to tell you is that the theorem should be called the "intermediate value theorem" and what it means. Math isn't just coming up with formally correct proofs for pre-existing statements.
I also don't see what "P vs NP" has to do with anything.
> Today, most of the math is figuring out how to solve an equation, i.e. to give an algorithm to calculate the solution. We then "quantize" the algorithm to a state machine (e.g. convert reals to floats, algorithm steps to machine code), so that we could run the state machine on a computer and get a result.
I'm a mathematician. What you wrote is just bonkers. Some parts of math are about writing algorithms to solve equations. The vast majority of math isn't.
And this is at the heart of P vs NP question, how to solve SAT, and once we understand that, all the math that is about solving equations (i.e. that of practical value) will become very boring. Kinda like when a game becomes solved with a computer.
(This reminds me of Chomsky and Norvig debate on the machine learning and nature of understanding. I wouldn't think I would take Norvig's position, yet here we are.)
Addendum: I am also not arguing that computers writing proofs are a necessity for this, but rather efficiently (as possible) solving SAT instances. You don't need to state a hypothesis (and thus prove it) for an infinite number of cases to solve practical problems.
I am also not judging value of math - yeah, it is fun. All I am saying it inherently has a human dimension in the sense we don't need it (assuming we have an efficient SAT solver) to solve practical problems.
I think most mathematicians would say that most of maths is not in solving equations because once you get the right equations, solving them is a simple mechanical process for the most part. Most of maths is figuring out what the right equations are in the first place and proving that what you have done is legitimate.
Also, the way you model reality (choose the equation) is often done with the limitations of solvability in mind.
I also disagree that maths can help you pick the right equations, just like there is no formal method that can verify whether a program specification is appropriate to the problem.
Equation (or a model) is just an infinite family of SAT problems, typically parametrized on our understanding what a "number" is. If we had a really good SAT solver, then getting a solution would indeed be a really straightforward process (just pick the number representation) of solving the instance. The same is also true for checking "legitimacy" (which I interpret as consistency) of the model - SAT solver would tell you that the instance is unsatisfiable and why. But you can never formally determine that the chosen SAT instance is appropriate model for the task at hand.
I think the mathematics is the same. Lot of its beauty we cherish, because we don't properly understand it on the "raw" level of SAT (I would write logic, but I really mean the simplest metalogic you need), which is evidenced by our lack of understanding of P vs NP. Once it is understood, the process of "doing math" will be understood algorithmically, and it will become "boring" or "dull".
But as I said, I don't think lack of universal meaning (or lack of mystique) has to detract from the beauty of mathematics.
- Polynomial problems can still require enormous computing power to the point they are unsolvable. Even if tomorrow there is an algorithm transforming every NP problem to a P problem, not all problems will be feasibly solvable. A O(n^100) Problem is still P.
- P vs. NP is about algorithmic complexity, it has no implications about mathematics being an algorithm or not.
- The most likely outcome is that P and NP are different, in which case there are zero implications on computational efficiency.
- Considering mathematical statements as algorithms has happened for a long time. Any outcome of P vs. NP has limited implications on the philosophy behind it. It just might make it somewhat better.
You just don't understand what P vs. NP is about, your posts are bizarre in the actual context of the problem statement. The implications on mathematics just aren't what you think they are.
And this question is crucial, because everything we can ask computers (or restated, math with real-world applications) can be rephrased in terms of finding a solution to a SAT instance. It can be a very large instance but if there is a practical way of approaching the problem, it shouldn't matter.
I think you're assuming that future computer scientists and mathematicians will continue to run (many different) algorithms, and I don't. I think there might be a single algorithm, a SAT solver, which will subsume all others.
>I think there might be a single algorithm, a SAT solver, which will subsume all others.
This is legitimately insane. You might as well hope for free energy, FTL Travel, or magic.
Yes, but that's the worst case on all possible instances. Even with this worst case performance, there might be an algorithm that works on par with other algorithms that specialize only on certain instances. E.g. there can be an O(2^n) algorithm for general SAT which performs in O(n^(3/2)) on XORSAT. We simply don't understand the problem well enough to tell.
Also the set of worst-case instances can be vanishingly small in practice.
You have a completely utopian idea about what might be computationally feasible. I don't even know what you are arguing. Certainly it is thinkable that SAT is somehow ridiculously simple to calculate, just in the same way that achieving simple and near free fusion energy is thinkable. It just isn't going to happen and speculating on it is pure science fiction.
These are, as I'm sure you know, utterly different. Nuclear fusion is real, 'simple' and 'near free' are engineering problems. If human civilization lasts long enough, and continues to progress technologically, we'll have that, for some value of 'simple' and 'near free'.
On the other hand, the conjecture that SAT is algorithmically feasible may be disproven, and in my opinion, will be. That would be "just isn't going to happen".
SAT is limited to propositional calculus which is far too weak for most mathematics.
Literal nonsense. Do you not realize that P vs. NP might have a negative outcome (extremely likely)?
>Today, most of the math is figuring out how to solve an equation, i.e. to give an algorithm to calculate the solution.
Plainly false. In basically any field proving the existence of a solution is far, far harder than calculating the solution numerically. See e.g. PDEs.
>We then "quantize" the algorithm to a state machine (e.g. convert reals to floats, algorithm steps to machine code), so that we could run the state machine on a computer and get a result.
Literally not true. Not even the assumption is right.
The outcome will matter less than having an answer. And I do think it will be a negative outcome either way, because it will obsolete lot of beautiful math, and replace it with a more mechanical process.
> In basically any field proving the existence of a solution is far, far harder than calculating the solution numerically.
First of all, if you want to ascertain whether the numerical algorithm works correctly, you have to prove the existence of the solution. That's part of the (equation -> solution algorithm) conversion process.
Now, you can possibly get by without proving existence of the solution for the infinite family (and confront the numerical solution directly with reality). But doing that is more complicated than, assuming there is a SAT solver, plug the SAT instance into it and see if there is a solution (and you can get, for a finite family of instances, a similar guarantee you would get from the existence proof).
> Not even the assumption is right.
Not sure what assumption you refer to. Computers don't run algorithms (because algorithms handle unbounded input/output), computers are just a very large state machines. So you need to convert the algorithm to a state machine first. Saying "run algorithm on a computer" is just a useful figure of speech, but somewhat misleading, because it implies certain quantization.
The negative outcome will have exactly zero implications about anything. Except "turns out we were right all along" polynomial problems are just fundamentally less hard than problems you can verify the solution of in polynomial time. This has ZERO implications on anyone, except the mathematicians who prove it, who will get a price and quite a bit of academic fame. That is literally it.
>But doing that is more complicated than, assuming there is a SAT solver, plug the SAT instance into it and see if there is a solution (and you can get, for a finite family of instances, a similar guarantee you would get from the existence proof).
Even is SAT is P that doesn't imply a solution can feasibly be found. And if P neq NP, then SAT might not be P.
It does, because in this case you also assumed that running numerical algorithm was feasible. So if your SAT solver fails to find the answer, it is either suboptimal method (because numerical method exists), or (if the instance is UNSAT) the numerical method gives you a flawed result.
I don't think you have any clue what you are actually talking about.
Small correction: If P != NP, then SAT definitely isn't in P. That's because SAT is NP-complete, so if it was in P, every other NP problem could be polynomially reduced to it and would hence also be in P.
> all mathematics will be replaced with an automated process
FOL is undecidable, so we know this is impossible.
Practically minded people will simply skip logical proofs and model the world directly with SAT instances. Mathematics will remain an intellectual curiosity.
In a way, I agree with the article - what makes math interesting is the human perspective and creativity. But I believe it's "worse" - taken objectively, math is actually pretty boring and there is only little depth.
That never happened, symbolic and numerical mathematics coexist to this day. Cryptography, for example, relies on exact arithmetic.
On that note, good luck trying to solve problems in cryptography with "SAT instances".
Symbolic/numeric is just analogy of the paradigm shift that will come to all (applied) math. Another example is in statistics, shift from parametric to non-parametric.
Cryptography.. relies on unproven belief in ETH or P/=NP or some such (in fact, cryptography has, since Caesar, relied on unproven beliefs about cryptosystems). But that's just a belief, we don't really understand how hard any of these specific problems are. Which is actually a great example of the new paradigm I am talking about, because it shows we don't need proofs (of statements about infinitely many things). We can just quantize things directly (into a state machine that actually does the crypto stuff) and be happy.
We haven't even scratched the surface of what is possible in P vs NP. In particular, CNF representation of SAT instances might be a really crappy one.
> Again, you miss the point, there will be a paradigm shift. Yes, symbolic maths still exists, but nobody is looking up a special function to solve an equation. They just plug the numbers (and the state machine approximation of the numerical operations) in the computer and numerically, the result comes out.
This is false.
Today, most of the math is figuring out how to solve an equation, i.e. to give an algorithm to calculate the solution. We then "quantize" the algorithm to a state machine (e.g. convert reals to floats, algorithm steps to machine code), so that we could run the state machine on a computer and get a result.
However, once you know what it takes to invert boolean functions, you don't need the solution step, you can just quantize your equation (problem) directly to a SAT instance, and let the inversion algorithm do all the hard work. No (elegant and readable) math is required anymore.
So I think we better treat mathematics as a "useless" human artifact (like art or chess) rather than something of practical value.