Gödel numbering: Reader seeks help understanding it

Gödel numbering: The code no one can explain

A reader trained in functional analysis admits he doesn't understand Gödel coding. He asked an AI, which gave an answer he found equally unhelpful. This sparks a debate where no one agrees on whether the issue lies in the subject matter or how it is taught.

Gödel numbering assigns a unique number to every symbol, formula, and proof in a formal system. It works by multiplying prime numbers raised to the power of each symbol's value. A five-symbol formula yields a huge number, its arithmetic fingerprint. Attributed to Kurt Gödel in 1931, this idea allows a system to refer to itself.

What is Gödel numbering and what is it for?

The mechanism applies the fundamental theorem of arithmetic. Each symbol gets a number; each formula becomes a product of primes; each proof, a product of products. Reversibility is total: you return from the number to the formula via prime factorization.

The purpose isn't decorative. Gödel needed a formal system to reference its own formulas as arithmetic objects. Only then could he construct a proposition essentially saying "I am not provable." Without this coding, the incompleteness theorems wouldn't exist.

Some argue the coding is trivial and the real difficulty came later: Gödel's diagonal argument from Cantor and Richard's paradox. The coding is just scaffolding, not the building.

Why the AI explanation fails

The initial request is clear: understand the numbering to grasp the two theorems. The automated response describes the theorems well but gets lost in the coding. The reader states plainly that he doesn't understand it.

Part of the discussion suggests the problem isn't the reader. The generated text has an assertive tone that triggers a "must be my fault" reflex. Yet it explains neither the mechanics nor the rationale behind the rule. This is a risk of language models: they sound confident without clarifying.

Other posts do get into the weeds. An example is provided: if a formula has five symbols, take the first five primes and raise them to the values assigned to each character. The result is a gigantic number. The key insight trinc: every expression in the formal language maps to a unique natural number.

The example that actually makes sense

For the formula "0 = x" with codes 1, 3, and 4, the Gödel number is 2¹ × 3³ × 5⁴, or 33,750. The operation is simple. What's hard is seeing why we do it.

The answer is that coding turns mathematical language into an arithmetically manipulable object. Properties of formulas—like "being provable"—become properties of numbers. This lets the system talk about itself without leaving arithmetic.

A calculation circulating in the thread breaks the process down step by step, yielding a difference that surprises those expecting manageable numbers. This isn't minor: the magnitude of these numbers is part of the argument.

Gödel, philosophy, and Hilbert's problem

The incompleteness theorems shattered Hilbert's program, which sought to formalize all mathematics completely and consistently. The first theorem states that in any consistent, sufficiently expressive system, there are propositions that can neither be proved nor refuted. The second states the system cannot prove its own consistency.

The discussion drifts into philosophy. Wittgenstein, Russell, Whitehead, and Principia Mathematica are mentioned as monumental efforts undermined by incompleteness. It is also noted that the course was often taught in philosophy departments, not math ones.

Some claim math is limited, but expanding the system captures what was left out. Counterarguments note that such expansion creates a new system with its own limitations.

The axiom of choice and other tangents

The conversation jumps to the axiom of choice, where mathematicians must decide whether to accept it. Gödel showed that if set theory axioms are consistent, the axiom of choice is too. Since a system's consistency can't be proven from within, the debate remains open.

Quantum computing appears as a potential way to break integer factorization, the basis of current cryptography. The reply is sharp: no quantum computer needed, a club suffices. The irony closes the tangent.

The thread ends where it began. Someone summarizes these as non-formalizable feelings. Another recommends a popular book, "Gödel, Escher, Bach," while others suggest specific texts on the theorem. The most repeated advice: start with divisibility, primes, and congruences, the basics of any number theory manual.

There is something curious about Gödel numbering: it takes three lines to explain and none to understand. The formula is simple. What isn't so simple is accepting that a number can contain a sentence, a proof, and a paradox.