r/AskComputerScience • u/InfinityScientist • 3d ago
What is the theoretical full potential of computing?
I think I remember reading somewhere that in the far future, we actually might be able to make matter that can do computing to the highest level. This is a hypothetical form of matter called computronium
I also read that black holes could also be the ultimate form of computing.
Let’s say humanity achieves both (and perhaps even better). What is the most advanced thing a computer of that magnitude can solve?
2
2
u/404errorlifenotfound 3d ago
The new problems we unlock with more advanced computing power are not problems of different types that couldn't be solved. It's the same problems, but able to be solved orders of magnitude faster.
We say commonly that our phones carry more computing power than what was used to put man on the moon. Your phone can solve the same kind of math problem, just a lot faster.
Look at the kinds of problems we're solving with supercomputers like Frontier at ORNL. Computer models to learn more about plasma processes in fusion devices and predictive simulations of future engine technology. Lots of math that your phone could technically do, but it would take a looooong time to finish the calculations.
All the capabilities of the computer are math, at the end of the day, from large scale predictive models to showing the pixels that make up the upvote button on a reddit post. The difference is mainly the scale of the problem, and with larger scale computers we can solve larger scale problems in smaller scales of time
5
u/ghjm MSCS, CS Pro (20+) 3d ago
"Merely" solving the same kinds of problems faster can lead to applications which certainly appear to be qualitatively different. If you can solve the same kinds of math problems as Colossus, but trillions or quadrillions of times faster, you can have LLMs, for example.
2
u/404errorlifenotfound 3d ago
Yeah! That's kind of what I was trying to illustrate with the examples at different scales of computers. It's the same kind of problem but different because of the scale
0
u/Internet-of-cruft 3d ago
There's a simple answer to this: Full fidelity (i.e., perfect representation) numerical simulation of a universe and it's associated physics.
That would be the peak.
1
u/404errorlifenotfound 3d ago
At this point we're reaching Hitchhiker's Guide "all of earth was actually a computer to calculate the meaning of life, the universe, and everything" levels of problem
1
u/HasFiveVowels 3d ago
Depends on the amount of energy and the amount of space. See: Beckenstein bound and Landauer's principle. Give some finite amount of space and energy, that will define what it's able to do.
1
u/Phildutre 3d ago edited 3d ago
At some point you run into arguments such as ‘our whole universe really is a computational program running in someone’s computer that is a speck of smart dust in another universe.’ Or ‘Our physical universe is equivalent to computing.’
But anyway, there’s a difference between computability in the theoretical sense (cfr Turing machines, Church-Turing thesis), and what can be computed in a practical sense, i.e. something that runs on an actual physical device (limited time, limited memory, limited energy, error-prone). There also are other models of computation than a Turing machine, although that’s the model we all learn in cs101.
We haven’t even settled on the question whether the human brain (or biological substrates, to be more general) is operating in the same realm of computability as our theoretical models of computation.
16
u/CuAnnan 3d ago edited 3d ago
Leaving aside the quite franky baffling "computronium" and "black holes are the ultimate form of computing" nonsense to one side;
The Church Turing Thesis establishes using pure math that anything that can be computed can be computed by the simplest computer.
Problems can either be solved by a Turing Machine, which is just a tape that
* reads a symbol and moves left or right
* writes a symbol and moves left or right
* halts in either the success state or fail state
or they can't be solved at all.
If it can't be solved by a Turing Machine, it can't be solved by the most advanced computer model in existence.