There is a question so basic that physics has never seriously tried to answer it: why does the universe have the laws it has rather than some other laws? A new formal framework — No External Model Selection, or NEMS — takes this question seriously and derives theorems from it.… Read More “What Would a Universe With No Outside Look Like? The NEMS Answer”
Not all possible universes are equal. A formal sieve, derived from the requirement that the universe have no outside, partitions all possible foundational theories into four classes. The universe we observe falls into a specific class — and this placement has provable consequences for everything from quantum mechanics to the existence of observers.… Read More “The Classification of Universes: What NEMS Proves About the Structure of Possible Worlds”
The NEMS program has produced dozens of structural laws — precise, memorable, and applicable far beyond physics. These are not philosophical opinions or empirical generalizations. Each one is a machine-checked theorem, or a compressed interpretive consequence of a machine-checked theorem. Here are the most important ones, stated plainly.… Read More “The NEMS Proverbs: What Closure Teaches Us”
Over the past several years I have been building a substantial formal research program — machine-verified, mathematically precise, and published with permanent DOIs on Zenodo. Today I am making the full index available at novaspivack.com/research. This post is an introduction to what the program covers and why I think it matters.… Read More “Introducing My Formal Research Program: From the Foundations of Reality to the Structure of Mind”
A machine-checked theorem proves that any closed physical universe rich enough to contain computation cannot internally contain a complete algorithmic account of its own record-truth. This is not about the limits of human knowledge. It is a theorem about the architecture of reality.… Read More “Physical Incompleteness: The Universe Cannot Contain a Complete Account of Itself”
A machine-checked theorem proves that no parametric self-model — no matter how rich, how large, or how powerful — can represent its own diagonal. The blind spot is not a resource limitation. It is structural. And it holds with no computability assumption, no arithmetic, no cardinality.… Read More “Representational Incompleteness: Why No Self-Model Can Capture Its Own Diagonal”
Gödel’s incompleteness, Turing’s halting undecidability, Kleene’s recursion theorem, Tarski’s truth undefinability, and Löb’s reflection theorem are five of the most celebrated results in 20th-century logic and computation. A new machine-checked theorem proves they are all instances of one master fixed-point framework.… Read More “One Theorem Behind Gödel, Turing, Kleene, Tarski, and Löb”
A machine-checked theorem proves that no sufficiently expressive reflexive system — no formal logic, no computer, no physical universe, no mind — can internally exhaust its own realized semantics. Physical incompleteness, representational incompleteness, and the classical barriers of Gödel, Turing, Kleene, Tarski, and Löb are all corollaries of one result.… Read More “Closure Without Exhaustion: Why Every System That Models Itself Has an Irreducible Remainder”
A new paper — backed by 422 machine-checked theorems and zero gaps — proves that a system can be completely governed by fixed laws and still never admit a final explanation. The implications reach from physics to biology to organizations to AI.… Read More “The End of Final Theories: How Fixed Laws Produce Inexhaustible Explanation”
This is the sixth essay in a series. The first, The Twist Move, describes the operation itself across mathematics, biology, physics, and business. The second, The Twist and the Ground of Being, argues that the consciousness twist is real, that the substrate must support it, and that this tells us something fundamental about the nature of reality.… Read More “The Theorem Behind the Twist – Lawvere’s Fixed-Point”
This article explains my paper on the
Mathematics of Self-Referential Systems, for a non-technical audience. The paper develops a comprehensive mathematical framework for understanding systems that can represent, model, or “know” themselves. While self-reference has long been seen as a source of logical paradoxes, this work argues it may be the fundamental organizing principle of reality itself—and provides specific mathematical bounds and requirements for achieving different levels of self-awareness.… Read More “A New Mathematics of Self-Reference: A Comprehensive Non-Mathematical Summary”
Have you ever wondered about the deep, perhaps even unsettling, nature of a thought thinking about itself?… Read More “The Mathematical Foundations of Self-Referential Systems: From Computability to Transfinite Dynamics”
Nova Spivack
www.novaspivack.com
May 28, 2025
This paper constructs a formal deductive argument for the necessity of a processing modality that transcends standard Turing-equivalent computation—termed herein “Transputation”—for any system capable of achieving “Primal Self-Awareness,” which we rigorously define as the foundational characteristic of sentience.… Read More “On The Formal Necessity of Trans-Computational Processing for Sentience”