Stephen Wolfram: Pure Math Isn't About Proving Theorems—It's About Asking the Right Questions
What's the Future for Pure Math Research in the Age of AI?
As AI headlines claim machines are solving math, Stephen Wolfram pushes back: pure mathematics is not mechanical theorem-proving but a human-driven sampling of the ruliad, the entangled limit of all computations. AI can mine millions of papers and spot connections, yet it cannot replace the imagination that chooses which questions to ask. Computation alone yields alien mathematics; true math requires human-level narratives that fit finite minds.
Great math is—more than anything else—defined by the questions it asks.
- alok-g
I see two assumptions in the core argument, both of which are open to challenge.
1. AI can do proofs, but deciding which problems to solve, which math is useful, is by humans.
2. The math that's picked needs to be understandable by humans.
For #1, AI may be able to play a significant, if not a takeover, role for even figuring out what math is useful.
For #2, understandability by humans may be good for now, but could also turn out to be a significant constraint. Correctness is a goal, trust is an important requirement, human understandability may be an intermediary for that, but not necessarily the end goal.
In other words, the article may stand the current state of the art, but may not stand merely a couple years down the road.
- veexx103
Some arguments are based on "past experience..."
However, such experiences are not absolute truths and cannot be equated with the current situation.
- suopspaces
Read by the author https://www.youtube.com/live/gPrWX8i1htM (with multiple mentions of the Wolfram language and such)
- jaykru
Wolfram gives a very important and sober take on the present state and future of pure math. I came away with the following key takeaways:
1. An essential goal of mathematics is human understanding. The computation of proof terms doesn't necessarily enrich human understanding. The proof of the four color theorem result is a good example, and formal verification/SAT solving gives many more: these are results that can be trusted up to our trust in the system used to produce them, and they can be used in practice, but they don't necessarily enrich our understanding. Imagine a computer with near infinite proof search powers set loose with the current human definitions, theorems, and understanding of mathematics. Suppose it constructs a proof for a new theorem at our mathematical frontier. The shortest such proof in terms of currently understood definitions and concepts could be so long and mechanical that the entire lineage of humans until the end of the universe could not finish reading it. So though it overlaps with the activity of mathematicians, this type of computational proof search is not mathematics as such. This is an important distinction that many people do not seem to grasp and some dismiss as cope.
2. The human activity of theory building, rendering otherwise monstrous proofs like the one I discussed above into light conceptual arguments a person can understand, appears at this time out of reach of models. Maybe they will do this in the future, but it is not yet the c […]
- amelius
What is a good exit strategy?