Editing Goodstein's theorem (section)

== Application to computable functions ==

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.