At the end of the 19th century, mathematics faced a crisis of foundations. Paradoxes identified in set theory invalidated the basic structure of the exact sciences. Thus, the race began to find an unassailable foundation for pure reason.
Table of Contents
The Crisis of Foundations and Russell’s Paradox
The German logician Gottlob Frege developed a system intended to ground all of mathematics exclusively in logic. His system was invalidated before publication by the mathematician and philosopher Bertrand Russell. He discovered a paradox concerning sets that do not contain themselves.
A classic example is the catalog of all bibliographies that do not include themselves. If this catalog includes itself, it violates the rule of its own definition. If it does not include itself, it becomes incomplete. Mathematically, this paradox is expressed by the set $R = \{ x \mid x \notin x \}$. If $R \in R$, then by definition $R \notin R$. Therefore, any purely logical system based on total freedom of set definition generated fatal contradictions.
The German mathematician David Hilbert intervened by proposing a program to save mathematics. He called for a rigorous axiomatization of the entire field. The goal of Hilbert’s program was the creation of a formal system—a mechanical assembly of axioms and rules of inference. This system had to be proven complete and consistent from within. Thus, any valid mathematical statement could be derived through a precise algorithm in a finite number of steps.
Arithmetization of Syntax: Gödel’s Proof
In 1931, the Austrian logician Kurt Gödel definitively invalidated Hilbert’s program through his First Incompleteness Theorem. He demonstrated an inalienable mathematical reality. Any consistent axiomatic system, capable of expressing the basic elements of arithmetic, contains statements that are true but unprovable.
To achieve this proof, Gödel invented Gödel numbering, a method of bijective encoding. Each mathematical symbol and logical operator was assigned a specific prime number. Every formula became a unique product of prime factors raised to specific powers, in the form $2^{n_1} \cdot 3^{n_2} \cdot 5^{n_3} \dots$. Arithmetic acquired a reflexive function. Equations could make mathematical statements about their own provability status.
Gödel constructed formula $G$, an equation encoding a self-referential statement. It declares: “Proposition $G$ cannot be proven within formal system $F$.” Mathematically, the concept is denoted as $F \not\vdash G$. If the system proves $G$, it proves a falsehood and becomes contradictory. If it does not prove $G$, the formula remains a true statement. Consequently, the axiomatic system is inherently incomplete.
The Halting Problem and Computational Limits
A few years later, the English mathematician Alan Turing transposed Gödel’s principles into the field of theoretical computer science. He published the Halting Problem, a mathematical demonstration of the limits of computability.
Turing proved the impossibility of creating a universal algorithm capable of determining in advance whether another program will stop or run indefinitely. We can exemplify this computational paradox through a theoretical Python script. This code exposes the logic through which the machine stalls: (verify code in Replit — This is a perfectly valid thought experiment, not production code — and it makes a genuinely profound point about the fundamental limits of computation.)
def halts(program_code): # This is a theoretical verification function. # It analyzes the code and returns True if the program will halt. pass def turing_paradox(): # This program uses the function above on its own code. if halts(turing_paradox) == True: while True: pass # The program enters an infinite loop if the function predicted it would halt. else: return "System halted" # The program halts if the function predicted an infinite loop.
Regardless of the verification function’s prediction, the algorithm automatically contradicts it. The mathematical impossibility of resolving the paradox becomes a clear computational barrier.
The Architecture of Probabilities in Artificial Intelligence
Generative artificial intelligence operates exclusively under these absolute restrictions. Neural networks are purely mathematical architectures—multidimensional matrices of weights. They apply a gradient descent algorithm to minimize an error function. An artificial algorithm cannot escape its vector space.
The model suffers from definitive ontological incompleteness. Artificial intelligence assembles semantic probabilities to mimic human language patterns. It lacks the capacity to validate objective truth from outside the dataset. The “hallucinations” of language models are not correctable code errors. They are direct manifestations of the limits described by Gödel and Turing. The system generates logical statements that it cannot verify absolutely from within its base of rules.
Moral Responsibility and the Hierarchy of Creation
The human mind possesses the capacity to step outside the formal system. It intuits the validity of Gödel’s formula without requiring a mechanical algorithmic proof. This capacity for transcendence marks the ontological distinction between silicon code and the Logos. Man was created with a unique capacity to spiritually evaluate reality.
This superior will derive exclusively from Jehovah, the Creator and Source of complete truth, consciousness, and moral order. The machine lacks consciousness and does not possess free will. Its binary operation knows neither the act of love nor moral responsibility. It will remain a strictly subordinate extension of its human creator.
Man, in his quality as the artisan of the code, acts as a steward of knowledge under divine authority. He holds moral responsibility for the systems he implements. The universe is not a closed axiomatic system. Creation is open and permanently sustained by the breath of the Creator.
The Incompleteness Theorem should bring humility to the study of pure logic. Reason has mathematically demonstrated the necessity of a higher instance to access the whole truth. Artificial intelligence will always remain limited by Gödel’s barrier, subject to man and subordinate to the supreme will.
Sources:
- Raatikainen, Panu. (2022). Gödel’s Incompleteness Theorems, The Stanford Encyclopedia of Philosophy. Link: plato.stanford.edu/entries/goedel-incompleteness/ — (Rigorous analysis of the theorems, Gödel numbering, and the limits of formal systems).
- Barker-Plummer, Dave. (2021). Turing Machines, The Stanford Encyclopedia of Philosophy. Link: plato.stanford.edu/entries/turing-machine/ — (Mathematical explanation of the limit of computability and the Halting Problem).
- Irvine, Andrew David. (2021). Principia Mathematica, The Stanford Encyclopedia of Philosophy. Link: plato.stanford.edu/entries/principia-mathematica/ — (Historical context of Russell’s paradox and the axiomatization attempts of Frege and Hilbert).
- Gödel, Kurt. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik. [Link: oup.com or similar academic resources] — (Original source of the proof regarding incompleteness).
Cover photo by Qian Shawn