Emerging Consciousness in Progress

Let us now turn to the human dimension for this inquiry.

A number of scientists and mathematicians have addressed the question of consciousness through the lens of Gödel's incompleteness theorems. Two figures stand out as particularly interesting to me: Roger Penrose and Douglas Hofstadter.

Roger Penrose, the English mathematician and physicist awarded the 2020 Nobel Prize in Physics for his contributions to general relativity and black hole theory, is also known for his controversial work on the nature of consciousness and machine intelligence, detailed in his books The Emperor's New Mind and Shadows of the Mind.

Douglas Hofstadter, a cognitive and computer scientist whose work centers on the mind, consciousness, and self-reference, explored these themes profoundly in his influential books Gödel, Escher, Bach: An Eternal Golden Braid and I Am a Strange Loop.

In this essay, I will explain and compare their theories on the nature and origin of consciousness, examine their logical coherence, and consider potential directions for future discussion.

To understand their arguments, we must begin at the heart of Gödel's theorems, the point from which both Penrose and Hofstadter draw foundational insights.

Gödel's incompleteness theorems are fundamental results in mathematical logic that establish strict limits on provability within any formal axiomatic system.

This was a profound bombshell for the mathematical community. It directly countered the prevailing goal, championed by mathematicians like David Hilbert, of establishing a complete and self-consistent foundation for all mathematics. Hilbert's program had aimed to prove the consistency of complex systems (like real analysis) using finitary methods from simpler ones, ultimately reducing all mathematics to the consistency of arithmetic. Gödel's theorems showed this to be impossible.

They consist of two theorems: the first theorem states that any consistent, formalized axiomatic system of number theory contains statements that are undecidable within the system. The second incompleteness theorem, an extension of the first, shows that the system cannot demonstrate its own consistency.

The theorems can be formally stated as follows:

Before we delve into Gödel's proof, it is essential to first clarify the key concepts embedded in these statements.

Formal systems. Formal systems consist of their language, set of axioms, rules of inference, and theorems.

Let us use the popular game of chess as an analogy for a formal system.

Completeness. Gödel's incompleteness theorems address the syntactic completeness of a formal system. A formal system is considered complete if, for every statement within its language, either the statement or its negation is provable from the system's axioms. In other words, the system can decide the truth value of every statement it can express.

Consistency. The theorems require these formal systems to be consistent. Consistency means the system cannot produce contradictions. For instance, it cannot simultaneously prove a statement P(x) and its negation, not-P(x).

In chess, the system is consistent: any board configuration is either possible or impossible under the initial setup and rules; it cannot be both. A single board state cannot, for example, be checkmate for both White and Black at once. Every legal move, derived from the rules, leads to another legal position.

Two stronger forms of consistency are relevant: 1-consistency and omega-consistency.

1-consistency is stronger than simple consistency. A system is 1-consistent if it does not prove an existential statement (there exists x such that P(x)) while also proving the negation of every specific instance, such as not-P(0), not-P(1), not-P(2), and so on.

Omega-consistency is stricter still. A system is omega-consistent if, whenever it proves that there exists x such that P(x), it does not also prove not-P(n) for every numeral n.

Axiomatizability. The formal system must also be axiomatizable in the context of Gödel's theorems. The set of axioms must be finite or at least decidable; that is, there must exist an algorithm (an effective method) capable of mechanically determining whether a given statement is an axiom. If this condition holds, the theory is termed recursively axiomatizable, or simply axiomatizable.

In the chess example, the set of axioms is finite, rendering it axiomatizable. A finite set is recursive: one can straightforwardly construct an algorithm (for example, "Is the statement on this list?") to verify membership.

Elementary arithmetic. Finally, the system must allow "a certain amount of elementary arithmetic" to be carried out. This phrase means the formal system must be sufficiently powerful to express fundamental properties of the natural numbers and their basic operations (e.g., addition and multiplication).

One might ask whether the chess system is 1-consistent or omega-consistent. These concepts, however, are purely syntactic and apply only to systems capable of expressing elementary arithmetic. Since chess lacks such expressive power, these notions are irrelevant to it.

What, then, qualifies as an arithmetic formal system? Examples include systems that generate number theory, i.e., statements about properties of natural numbers (e.g., "3 is prime" or "1792 is the sum of two squares").

Decidability. Decidability is central to understanding Gödel's theorems. In computability (recursion) theory, a decision method, a mechanical method, and a procedure are different ways of describing the same fundamental concept: an algorithm.

A decidable set is a direct consequence of this. A set of numbers is decidable if there exists a computable function that can determine, for any given number, whether it belongs to the set. The function must always produce a "yes" or "no" answer in a finite amount of time. The concept of a recursive set is synonymous with a decidable set.

Computability. Computability is the ability to solve a problem by an effective procedure.

The Turing machine. Another way to look at computation is by equating it to the action of a Turing machine. Introduced by Alan Turing around 90 years ago, a Turing machine is a theoretical and mathematically idealized computer which can run forever and never makes mistakes.

A Turing machine consists of an infinite tape, a read/write head, a state register, and a table of rules.

With the initial state (the axioms) and the table of rules, the machine is able to change its state accordingly, and the process is endless.

Here we examine some formal systems pertinent to the incompleteness theorems.

Robinson arithmetic. Robinson arithmetic, commonly denoted as Q, was introduced by R. M. Robinson in 1950 and later discussed in the influential 1953 work Undecidable Theories by Tarski, Mostowski, and Robinson.

Robinson arithmetic is regarded as the weakest standard system of arithmetic relevant to discussions of incompleteness and decidability. It treats 0 as the smallest natural number and is defined by seven axioms.

Peano Arithmetic (PA). Peano Arithmetic (PA) was introduced by Giuseppe Peano in 1889 and serves as the classical formal system for the arithmetic of natural numbers (0, 1, 2, ...). It provides axioms defining fundamental properties, such as the existence of a unique successor for every number, and incorporates the principle of mathematical induction.

PA is notably stronger than systems like Primitive Recursive Arithmetic (PRA), as it permits full induction over all first-order formulas, rather than restricting induction to quantifier-free statements. It is this expressive power that makes PA a central object of study in metamathematics, and the system to which Gödel's incompleteness theorems are most famously applied. Gödel demonstrated that if PA is consistent, then it is necessarily incomplete: there exist arithmetical truths that cannot be proven within PA itself.

Primitive Recursive Arithmetic (PRA). Primitive Recursive Arithmetic (PRA) is a formal system of arithmetic that is stronger than Robinson Arithmetic (Q). First proposed by Norwegian mathematician Thoralf Skolem in 1923 as a formalization of his finitistic conception of arithmetic, it was later rigorously formalized by Stephen Kleene. PRA is sufficiently powerful to formalize most finitary mathematics, though it remains weaker than Peano Arithmetic (PA).

Finitary mathematics, central to David Hilbert's program of establishing mathematical consistency through finite, combinatorial methods, deals with concrete, finite objects such as individual numerals. These can be explicitly written down and manipulated. Finitary reasoning focuses on such objects and the rules governing their manipulation, rather than on infinite sets like the complete set of natural numbers N.

PRA is not defined by a traditional list of axioms, but rather by a set of rules for constructing and defining primitive recursive functions. These are a class of total computable functions from natural numbers to natural numbers, constructed from initial functions (zero, successor, and projection) using composition and primitive recursion. All such functions are guaranteed to terminate after finitely many steps.

Unlike PA, which uses full first-order logic and allows induction over arbitrary formulas, PRA employs only quantifier-free induction. This restriction makes it a conservative, finitistically acceptable system, but also one of weaker proof-theoretic strength than PA.

Second-order arithmetic (PA2). Second-order arithmetic, also often denoted by Z2, is stronger than PA. It employs second-order logic, i.e., quantifiers can be applied not just to numerals but also to properties.

Zermelo-Fraenkel Set Theory (ZFC). Named after mathematicians Ernst Zermelo and Abraham Fraenkel, this is the most common axiomatic system for modern mathematics. Proposed in the early twentieth century, it is a system of axioms that defines sets and their properties. Almost all mathematical objects, including numbers, can be constructed within ZFC. Because it can represent arithmetic, ZFC is also subject to Gödel's theorems: if it is consistent, it cannot prove its own consistency.

The goal of ZFC is to generate a consistent and rigorous framework for mathematics and to avoid paradoxes such as Russell's Paradox. The core idea of ZFC is that all mathematical objects, including numbers, functions, and geometric figures, can be represented as sets.

The system of Principia Mathematica. This is the logical system that Kurt Gödel specifically analyzed in his original 1931 paper. It was an ambitious attempt by Alfred North Whitehead and Bertrand Russell to create a complete and consistent system for all of mathematics, built from fundamental logical principles. Gödel's work demonstrated that their goal was, in principle, unattainable.