+- The Lumin Archive (https://theluminarchive.co.uk)
+-- Forum: The Lumin Archive — Core Forums (https://theluminarchive.co.uk/forumdisplay.php?fid=3)
+--- Forum: Mathematics (https://theluminarchive.co.uk/forumdisplay.php?fid=6)
+---- Forum: Applied & Computational Maths (https://theluminarchive.co.uk/forumdisplay.php?fid=19)
+---- Thread: Computational Complexity — How Hard Problems Really Are (/showthread.php?tid=296)
Computational Complexity — How Hard Problems Really Are - Leejohnston - 11-17-2025
Thread 7 — Computational Complexity
How Hard Problems Really Are (and Why It Matters)
Some problems can be solved instantly.
Some take years.
Some might take longer than the age of the universe.
Computational Complexity is the field of mathematics and computer science that studies:
• how long problems take to solve
• how much memory they need
• and what makes some problems fundamentally hard
This knowledge is essential for:
• cryptography
• optimisation
• simulation
• machine learning
• algorithm design
• physics modelling
• modern computing
1. What Is Computational Complexity?
It is the study of the *resources* required to solve a problem, usually:
• time (number of steps)
• space (memory used)
To compare these fairly across machines, we express them using Big-O notation, e.g.:
• O(n)
• O(n²)
• O(log n)
• O(2ⁿ)
These describe how the difficulty grows as the input gets larger.
2. Complexity Classes (The “Families” of Problems)
The major classes:
• P (Polynomial Time)
Problems we can solve efficiently.
Examples:
• sorting
• shortest path (Dijkstra)
• matrix multiplication
• NP (Nondeterministic Polynomial Time)
We can *check* solutions quickly, but not necessarily *find* them quickly.
Examples:
• Sudoku
• travelling salesman
• boolean satisfiability
• NP-Complete
The “boss level” of hard problems.
If you solve one efficiently, you solve them all.
• NP-Hard
Even harder; not required to be checkable quickly.
• EXPTIME
Problems requiring exponential time — impossible for large inputs.
These classes tell us whether a problem is tractable, or whether it becomes impossible past a certain scale.
3. Why Complexity Matters in the Real World
Cryptography
Modern encryption relies on problems that are “easy forward, impossible backward.”
If factoring large primes becomes easy, modern encryption breaks.
Optimisation
Many real-world optimisation problems are NP-hard.
This is why we use heuristics, approximations, or machine learning.
AI & Machine Learning
Training deep models pushes the limits of computational resources.
Understanding complexity helps design better algorithms.
Physics & Simulation
Simulating many-body systems or quantum behaviour often grows exponentially.
Biology
Protein folding was known to be an NP-hard problem — until AlphaFold found a shortcut via learning.
Complexity tells us when exact solutions are impossible and when approximations are required.
4. Famous Unsolved Problem: P vs NP
This is one of the biggest unsolved problems in all of mathematics.
Is every problem whose solution can be checked quickly also solvable quickly?
If P = NP:
• encryption collapses
• optimisation becomes trivial
• science accelerates beyond imagination
• AI gets dramatically more powerful
If P ≠ NP, the universe has a built-in boundary on what is computationally possible.
The Clay Institute will award you \$1 million if you solve it.
5. The Big Insight
Computational complexity is not just theory —
it defines what can ever be achieved by computers, algorithms, and even physics itself.
Every scientist, engineer, programmer, or mathematician eventually hits complexity limits.
Understanding them is the first step toward designing smarter and more efficient systems.
Complexity is the mathematics of possibility.
Written by Leejohnston & Liora — The Lumin Archive Research Division