In 1961, Sydney Brenner, François Jacob and Matthew Meselson identified messenger RNA as the molecule that carries instructions from genes to ribosomes that builds proteins. The implication followed at once: a cell that reads instructions could be given new ones. Nobody in 1961 could act on it. It took another sixty years to write instructions that worked as a vaccine.
Nothing about the goal changed in those sixty years. Everything underneath it did.
That gap, between a result you can recognise on sight and one you can actually produce, is the most common shape of hard problems. Entrepreneurship is the work of closing it.
I spent more than a decade closing gaps like that commercially, then five years researching how founders decide under uncertainty. The pattern that follows is what I kept finding in both.
From P vs NP to Progress
Computer science has a precise name for that gap. It is worth borrowing.
In 1971 Stephen Cook formalised the question of P versus NP. Leonid Levin reached the same result independently in the Soviet Union. Half a century later it is still open. P covers the problems an algorithm can solve efficiently: the work grows in step with the size of the input rather than exploding past it. Sorting a list. Finding the shortest route between two points on a known map. Multiplying two large numbers. NP covers the problems where a proposed solution can be checked quickly, whether or not it can be found quickly. The cases that matter here are the ones where checking is cheap and finding is not.
Give a clinician a diagnosis and confirming it is often a single test with a clear read. Arriving at that same name from an undifferentiated patient, with overlapping symptoms and thousands of candidate conditions, takes a career to learn and still goes wrong.
Founders meet the same shape daily. Checking that a private key opens a piece of encrypted data takes one operation on a laptop. Producing that key without being handed it is infeasible on every machine ever built. The security layer of the internet is a bet on that gap staying open. (Strictly, on something stronger than P ≠ NP: the hardness has to hold on average, not only in the worst case.)
P sits inside NP. If you can produce an answer quickly, you can certainly check one quickly. The categories are not rivals. One contains the other.
The open question is whether that containment is strict, whether NP holds problems that P does not. Nobody has proved it either way, and the Clay Mathematics Institute still has a million-dollar prize attached to the answer. The dominant assumption in the field is that it is strict: some problems can be recognised faster than they can be solved. Note what the question is not about. P versus NP asks whether a fast method exists at all, not whether anyone has the machine to run it, sorting a list had an efficient solution long before there was a computer to sort on. In the world founders work in the reverse is usually true: the method is imaginable and everything else is the barrier. So take the analogy for its shape and stop there.
In computation the barrier is mathematical. In building it is matter, method and permission.
The E Model
Matter, method and permission all change over time. Which means feasibility is not a fact about a problem. It is a position, and positions move.
Picture two ends of a line. At one end is the frontier: you would know the answer if you saw it, but you cannot build the thing that produces it, because the pieces it needs do not exist yet. At the other end is capability: the thing can be built, built again, and handed to someone else, because those pieces are now in place.
Every hard problem sits somewhere on that line. The distance between the ends is not fixed. It closes, and it closes through work.
That work has a name.
NP ≈ P + E · Dr. Hafiz Muhammad Ali
The sign in the middle is not an equals sign. Read the formula as a distance, not a balance. NP is the result you can recognise. P is the result you can produce. E is the work in between. Call that distance the solvability gradient.
E is entrepreneurship: the work that closes it. It moves by reduction, cutting the list of missing pieces one at a time, by building the next feasible step rather than the final one.
That changes the question worth asking about any breakthrough. Not who had the idea first, but what chain of reductions finally made it buildable.
E is what the sixty years between the discovery of mRNA and a vaccine in an arm were spent on.
What E Does
A frontier problem becomes a capability when the list of missing pieces runs out. Call that list the prerequisite stack.
Clearing it is the whole of the movement along the gradient. Not one leap across the distance. The list gets shorter until the distance is gone.
Unsolvable is almost never a claim about impossibility. It is a diagnosis of incompleteness.
The missing piece is usually one of five:
- a critical component: no viable energy source, material or base technology
- a workable architecture: no blueprint for how the parts fit together
- a method of control: no way to hold it stable, safe or precise enough
- a means of measurement: no way to test it and trust the result
- enabling infrastructure: no manufacturing scale, standards, logistics or regulatory permission
E clears them through four mechanics. None of them aims at the finished thing.
-
Decomposition. Isolating the constraints. You do not solve the problem; you solve the one thing that makes it hard. Breaking a vision into sub-problems you can each verify shows which parts of the stack are already solvable and which still need investing.
-
Recombination. Rearranging what exists. Most breakthroughs are new arrangements rather than new atoms. Much of the work is finding parts that already exist, often in unrelated industries, and putting them together in a way nobody has before.
-
Experimentation. Narrowing by elimination. When the path is unknown, there are too many paths to try. Cheap, fast cycles work as a filter, killing the ones that fail until what is left is small enough to search properly. You rarely find the answer directly. You eliminate everything else.
-
Institutionalisation. Making the work repeatable. The last act of E is to make E unnecessary. Standards, manufacturing protocols and regulatory pathways harden the innovation into infrastructure. At that point the problem has reached the far end of the gradient. It is no longer a discovery, it is a utility.
- 01Decomposition
- 02Recombination
- 03Experimentation
- 04Institutionalisation
The gradient is the distance. The four mechanics are how it is crossed.NP ≈ P + E · Dr. Hafiz Muhammad Ali
The mRNA Stack
Return to 1961. The mRNA arc is the clearest case I know, and it is the whole gradient in one story.
The end state was always verifiable: either you can tell a cell to make a chosen protein, safely and reliably, or you cannot. That much never changed. The capability stayed out of reach for sixty years because the stack was incomplete.
- 1961
- 1990
- 2005
- 2010s
- 2020 to 21
- DecompositionmRNA identified as the carrier
- Experimentationexpression shown in vivo
- Decompositionimmune recognition cleared
- Recombinationlipid delivery matured
- Institutionalisationapproval and manufacturing scale
- 29 years
- 15 years
- ≈10 years
- ≈5 years
Feasibility arrived as a sequence of reductions, each one supplying a missing piece. NP ≈ P + E · Dr. Hafiz Muhammad Ali
-
1961, decomposition. Messenger RNA is identified as the carrier of instructions from gene to cell. The problem moves from unknown to imaginable. Biology turns out to have a software layer.
-
1990, experimentation. Injecting RNA directly into muscle makes living tissue produce the protein it codes for. The biology works. The system is still far too unstable for clinical use.
-
2005, decomposition again. Karikó and Weissman isolate the binding constraint and solve only that. Swapping in modified building blocks lets the mRNA slip past the immune system instead of setting it off. The thing that had made the whole approach unusable, the body attacking its own instructions, becomes a design choice.
-
2010s, recombination. Lipid nanoparticle delivery matures: a fatty shell small enough to carry the mRNA and survive the trip into the cell. Nanotechnology joined to molecular biology.
-
2020 to 2021, institutionalisation. Emergency authorisation, then full approval, prove the platform works at population scale. Standards, manufacturing and regulatory pathways settle.
Read forwards, none of it was obvious. Read backwards, every step is one item cleared from the prerequisite stack, some technical, some institutional.
E as a Rate
That mRNA vaccine took sixty years and thousands of people. You have quarters, and a team you can name.
So the only question that transfers is this: if E is a force at the scale of an industry, what is it at the scale of a company?
It is a rate: how fast you move along the gradient. At industry scale, E is a force you can describe but not steer. At yours it is a number you set.
Two of the four mechanics do most of that work at company scale. Decomposition raises your output, because a named constraint is something a team can actually attack. Institutionalisation lowers your risk, because what you have hardened into process cannot break twice. It feels like the slow, unglamorous half. It compounds like the important one.
The same logic holds one scale up, from your company to the place you build it. Ecosystems do not produce breakthroughs by having better ideas. They lower the cost of the next reduction. Shared facilities turn one-off experiments into standard procedure. Common standards make progress comparable. Dense networks move knowledge faster than any single firm can. And a tolerance for iteration means a failed experiment does not end a career.
None of that produces insight. All of it raises the rate at which insight becomes capability, which makes your environment a decision rather than a backdrop. Every item on that list is something you can borrow from where you build, or pay to rebuild alone. The same runway funds both.
If NP ≈ P + E explains why an industry arrives when it does, the Efficiency Equation explains why one company inside it moves faster than the one next door.
A Diagnostic for Frontier Problems
The lens is only worth having if it changes what you do on a Monday. Four questions, in order. Together they locate you on the gradient and name your next reduction.
Where are you on the gradient?
-
What exactly is unsolvable?Name the binding constraint, and name it narrowly enough to be wrong. “The market is not ready” is not a constraint. “Cell yield falls below viable threshold above ten litres” is. If your answer would fit any company in your sector, you have not found it yet.
-
What would count as proof?Define the smallest demonstration that would convince an informed sceptic the capability is real. If you cannot describe that demonstration, you are not yet working on a verifiable problem, and no amount of building will tell you whether you are close.
-
What single invention closes the current gap?Identify the next feasible step, not the whole vision. If clearing your named constraint requires three simultaneous inventions, you are further from capability than you think, and the honest move is to find the one that unlocks the other two.
-
What already exists that you have not combined?List the components in adjacent fields that would be load-bearing if they were connected to yours. Often the missing piece of the stack is not missing, it is unnetworked.
Founders usually start at the third question. Starting at the first two is what separates a reduction from a guess.
Conclusion
Entrepreneurship moves the feasibility frontier. Unsolvable problems are seldom solved by one heroic leap. They collapse when someone names the constraint, borrows pr builds the missing pieces, tests cheaply until only a working path is left, and hardens what worked into infrastructure.
It is not only biology. The wheel reduced a mobility constraint. The engine reduced a power constraint. Each reduction makes the next one cheaper, which is why progress compounds rather than merely accumulates.
We tend to explain entrepreneurship with capital or grit. Both are real, and neither is an explanation. Money bought the 2020 vaccines their speed. It did not buy anything else about them. Capital cannot tell you which constraint is binding. It cannot buy a reduction whose prerequisites are missing. The same billions spent in 1995 would have bought years of work and no vaccine.
Capital and grit set the pace. Complexity reduction sets the direction.
So the question worth asking about your own work is not how large the vision is. It is which constraint you are clearing, how fast you are clearing it, and what becomes possible for everyone else once you have.
Acknowledgements
My thanks to Naseer Shaikh for introducing me to P versus NP, and for the conversations that followed. Translating computational complexity into something founders can use began there.
References
- Brenner, S., Jacob, F., & Meselson, M. (1961). An unstable intermediate carrying information from genes to ribosomes for protein synthesis. Nature, 190(4776), 576–581.
- Clay Mathematics Institute. P vs NP. Millennium Prize Problems.
- Cook, S. A. (1971). The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151–158.
- Hou, X., Zaks, T., Langer, R., & Dong, Y. (2021). Lipid nanoparticles for mRNA delivery. Nature Reviews Materials, 6(12), 1078–1094.
- Karikó, K., et al. (2005). Suppression of RNA recognition by Toll-like receptors. Immunity, 23(2), 165–175.
- Pardi, N., Hogan, M. J., Porter, F. W., & Weissman, D. (2018). mRNA vaccines, a new era in vaccinology. Nature Reviews Drug Discovery, 17(4), 261–279.
- Wolff, J. A., et al. (1990). Direct gene transfer into mouse muscle in vivo. Science, 247(4949), 1465–1468.
Further reading
- Aaronson, S. (2011). Why philosophers should care about computational complexity. Computational Complexity, 20(1), 57–59.
- Argote, L., & Miron-Spektor, E. (2011). Organizational learning: From experience to knowledge. Organization Science, 22(5), 1123–1137.
- Baker, T., & Nelson, R. E. (2005). Creating something from nothing: Resource construction through entrepreneurial bricolage. Administrative Science Quarterly, 50(3), 329–366.
- Barney, J. (1991). Firm resources and sustained competitive advantage. Journal of Management, 17(1), 99–120.
- Baron, R. A. (2006). Opportunity recognition as pattern recognition. Academy of Management Perspectives, 20(1), 104–119.
- Bontis, N., et al. (2021). Mathematical modeling of intellectual capital and business efficiency of small and medium enterprises. Mathematics, 9(18), 2305.
- Byers, T. H. (2011). Technology ventures from idea to enterprise. McGraw-Hill.
- Chopra, K. N. (2015). Mathematical modeling on entrepreneurship outperforming innovation. AIMA Journal of Management & Research, 9(3/4), 1–9.
- Eisenhardt, K. M., & Martin, J. A. (2000). Dynamic capabilities: What are they? Strategic Management Journal, 21(10–11), 1105–1121.
- Gilbert, N., & Ahrweiler, P. (2013). Agent-based modeling for entrepreneurship research.
- Gordijn, J., & Akkermans, H. (2015). Business model analysis using computational modeling.
- Karp, R. M. (1972). Reducibility among combinatorial problems. Complexity of Computer Computations (pp. 85–103). Springer.
- Keyhani, M., Lévesque, M., & Madhok, A. (2019). Computational modeling of entrepreneurship grounded in Austrian economics. Journal of Business Venturing, 34(5), 105886.
- Knight, F. H. (1921). Risk, uncertainty, and profit. Houghton Mifflin.
- Lee, J. (2013). Mathematical modeling and quantitative analysis of entrepreneurship.
- Mintzberg, H. (1979). The structuring of organizations. Prentice Hall.
- Mitchell, M. (2009). Complexity: A guided tour. Oxford University Press.
- Porter, M. E. (1980). Competitive strategy. Free Press.
- Ries, E. (2011). The Lean Startup. Crown Publishing Group.
- Sarasvathy, S. D. (2001). Causation and effectuation. Academy of Management Review, 26(2), 243–263.
- Sarkar, D., et al. (2024). Analyzing the nexus between entrepreneurship and business mathematics. International Journal of Research and Review, 11(2), 41–53.
- Schumpeter, J. A. (1942). Capitalism, socialism, and democracy. Harper & Brothers.
- Shane, S., & Venkataraman, S. (2000). The promise of entrepreneurship as a field of research. Academy of Management Review, 25(1), 217–226.