Take the hereditary base-n + 1 representation of G(m)(n).

Replace each occurrence of the base-n + 1 with n + 2.

Subtract one. (Note that the next term depends both on the previous term and on the index n.)

Continue until the result is zero, at which point the sequence terminates.

The Goodstein sequence G(m) of a number m is a sequence of natural numbers. The first element in the sequence G(m) is m itself. To get the second, G(m)(2), write m in hereditary base-2 notation, change all the 2s to 3s, and then subtract 1 from the result. In general, the (n + 1)-st term, G(m)(n + 1), of the Goodstein sequence of m is as follows:


Early Goodstein sequences terminate quickly. For example, G(3) terminates at the 6th step:


Later Goodstein sequences increase for a very large number of steps. For example, G(4) OEISA056193 starts as follows:


Elements of G(4) continue to increase for a while, but at base , they reach the maximum of , stay there for the next steps, and then begin their descent.


However, even G(4) doesn't give a good idea of just how quickly the elements of a Goodstein sequence can increase. G(19) increases much more rapidly and starts as follows:


In spite of this rapid growth, Goodstein's theorem states that every Goodstein sequence eventually terminates at 0, no matter what the starting value is.

Take the hereditary base bn representation of G(m)(n).

Replace each occurrence of the base bn with bn+1.

Subtract one.

Kirby and Paris (1982) proved that

The Goodstein function, , is defined such that is the length of the Goodstein sequence that starts with n. (This is a total function since every Goodstein sequence terminates.) The extremely high growth rate of can be calibrated by relating it to various standard ordinal-indexed hierarchies of functions, such as the functions in the Hardy hierarchy, and the functions in the fast-growing hierarchy of Löb and Wainer:


Some examples:


(For Ackermann function and Graham's number bounds see fast-growing hierarchy#Functions in fast-growing hierarchies.)

Application to computable functions[edit]

Goodstein's theorem can be used to construct a total computable function that Peano arithmetic cannot prove to be total. The Goodstein sequence of a number can be effectively enumerated by a Turing machine; thus the function which maps n to the number of steps required for the Goodstein sequence of n to terminate is computable by a particular Turing machine. This machine merely enumerates the Goodstein sequence of n and, when the sequence reaches 0, returns the length of the sequence. Because every Goodstein sequence eventually terminates, this function is total. But because Peano arithmetic does not prove that every Goodstein sequence terminates, Peano arithmetic does not prove that this Turing machine computes a total function.

Non-standard model of arithmetic

Fast-growing hierarchy

Paris–Harrington theorem

Kanamori–McAloon theorem

Kruskal's tree theorem

Kirby, L.; (1982). "Accessible Independence Results for Peano Arithmetic" (PDF). Bulletin of the London Mathematical Society. 14 (4): 285. CiteSeerX 10.1.1.107.3303. doi:10.1112/blms/14.4.285.

Paris, J.

Rathjen, Michael (2014). "Goodstein revisited". :1405.4484 [math.LO].

arXiv

(1944), "On the restricted ordinal theorem", Journal of Symbolic Logic, 9 (2): 33–41, doi:10.2307/2268019, JSTOR 2268019, S2CID 235597.

Goodstein, R.

Cichon, E. (1983), "A Short Proof of Two Recently Discovered Independence Results Using Recursive Theoretic Methods", Proceedings of the American Mathematical Society, 87 (4): 704–706, :10.2307/2043364, JSTOR 2043364.

doi

Caicedo, A. (2007), (PDF), Revista Colombiana de Matemáticas, 41 (2): 381–391.

"Goodstein's function"

"Goodstein Sequence". MathWorld.

Weisstein, Eric W.

Some elements of a proof that Goodstein's theorem is not a theorem of PA, from an undergraduate thesis by Justin T Miller

- Thesis by Dan Kaplan, Franklan and Marshall College Library

A Classification of non standard models of Peano Arithmetic by Goodstein's theorem

Definition of Goodstein sequences in Haskell and the lambda calculus

The Hydra game implemented as a Java applet

Javascript implementation of a variant of the Hydra game

- good exposition with illustrations of Goodstein Sequences and the hydra game.

Goodstein Sequences: The Power of a Detour via Infinity

Archived 2017-02-04 at the Wayback Machine

Goodstein Calculator