The Questions No Computer Can Ever Answer

> WillThisProgramStop.exe
Analyzing...
Analyzing...
Analyzing...
ERROR
Unable to determine._

Can Everything Be Computed?

Introduction

Every year our computers get faster. Our phones become more powerful, and artificial intelligence seems capable of doing things that would have sounded absolutely insane just a decade ago.

It's really easy to start believing this sort of quiet sci-fi assumption: that if we just keep upgrading the hardware, eventually we will hit a point where just about anything is solvable. Like if there were some sort of giant loading screen and we are just waiting for the progress bar to finish.

But, unfortunately, mathematics has a habit of ruining this optimism.

Some questions can simply never be answered by any computer that could ever exist.

And that is where Alan Turing enters the picture, basically to bring us all down to earth for a sec because there's no way we're getting tickets to that show...

The Dream of Computation

In the early 1900s, mathematicians were on a mission. They wanted to turn mathematics into something completely formal and rule-based. The dream was that reasoning itself could be reduced to mechanical steps.

The idea was basically:

If we can write down a procedure, then a machine should be able to follow it.

And to be honest, that feels pretty reasonable. That is literally what computers do. You give them instructions, they follow them without complaining, and occasionally they crash for emotional reasons (read: bugs).

There was a growing belief that every well-defined problem should eventually be solvable if we just found the right procedure. Like there was a perfect instruction manual for reality, we just hadn’t finished writing it yet.

Alan Turing's Question

Then Alan Turing shows up and asks a deceptively simple question:

Can we create a program that determines whether another program will eventually stop running or run forever?

At first glance, this feels like a “sure, obviously” kind of problem.

You imagine a super-smart computer looking at another program like: “Hmm yes, I have analyzed this program. It will either eventually stop or run forever.”

It sounds like something a powerful enough system should be able to figure out. After all, if computers can simulate other computers, surely they can predict them too.

But Turing discovered something genuinely shocking.

No such program can exist.

The Halting Problem

We really don't even need heavy technical language here. The idea is already strange enough on its own.

Imagine a magical software tool. You feed it any program, and it confidently tells you one of two things:

• “This program will eventually stop.”
• “This program will run forever.”

It sounds incredibly useful. Like the kind of thing every computer science student would install immediately and then immediately become suspicious of.

Turing proved that this tool is impossible.

Not “hard to build.”

Not “we need better technology.”

Impossible.

The reason is a clever self-reference trick, something that feels closer to a philosophy paradox than an engineering problem. You essentially create a situation where the program ends up analyzing itself in a way that forces a contradiction. The system collapses under its own logic.

It is the computational equivalent of asking a mirror to reflect itself reflecting itself until reality gets uncomfortable and leaves the room.

Why This Matters

Buckle up baddies because this is the part where everything shifts.

Turing’s result means there are fundamental limits to computation itself.

Not practical limits. Not “we need more RAM” limits. Not “maybe GPT-17 will fix it” limits.

Fundamental ones.

No future supercomputer can bypass them. No breakthrough in engineering removes them. No artificial intelligence, no matter how advanced, escapes them.

There are simply some questions that cannot be answered algorithmically. Ever.

And that is the uncomfortable part. Because we are used to thinking of intelligence as something that keeps expanding outward, solving more and more problems over time. But here, we hit something that does not move.

It is a wall made of logic.

The Physics Connection

To make things even more interesting, especially if you like physics, it helps to zoom out for a moment. Physics often has this ambition of finding a final description of reality. A Theory of Everything. A set of equations that, in principle, explain all physical phenomena. 

But Turing’s result raises a slightly unsettling question:

If there are limits to computation, could there also be limits to prediction?

Are there physical systems whose behavior is fundamentally uncomputable?
Are there questions about the universe that no intelligence could ever FULLY resolve?
Could reality itself contain structures that outgrow algorithmic reasoning?!

These are not settled questions. They are still being explored at the edges of physics, mathematics, and philosophy.

But Turing’s work quietly suggests something important: even if we understand the rules of the universe, that does not automatically mean we can compute all their consequences.

Knowing the rules is not the same as being able to run the simulation perfectly.

Conclusion

We often tend to imagine progress as a straight line: faster computers, smarter algorithms, more capable artificial intelligence, getting over your lesbian situationship, and eventually a point where every problem has a solution waiting to be discovered.

But one of the most important results in the history of computation tells a different story.

Some limits are not temporary. They are not caused by slow hardware or incomplete knowledge. They are built into the structure of logic itself.

No matter how advanced our machines become, there will always be questions that no algorithm can answer.

It is not a matter of intelligence or effort.

In some cases, there is simply no solution for an algorithm to find.

💻💻💻

Thanks for reading!