The Kirby-Paris hydra game is a one-player game played on a tree that can last a very large number of turns. It gives rise to a function \( ext{Hydra}(n)\) that eventually dominates all recursive functions which are provably total in Peano arithmetic, and is itself provably total in PA + "\(\varepsilon_0\) is well-ordered." The game is closely related to Beklemishev's worms.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
dbkwik:googology/p...iPageUsesTemplate | |
Author |
|
Year |
|
notation |
|
growthrate | |
abstract |
|
is wikipage disambiguates of |