The weary wombat function, denoted \( ext{WW}(n)\), is an "inverse" of the frantic frog function. \( ext{WW}(n)\) is defined as the minimum number of steps taken before halting by an \(n\)-state machine that prints \( ext{PP}(n)\) 1's given blank input. It was first investigated and named by James Harland, as part of his "Zany Zoo" Turing machine research project.
| Attributes | Values |
|---|---|
| rdfs:label |
|
| rdfs:comment |
|
| dcterms:subject | |
| dbkwik:googology/p...iPageUsesTemplate | |
| abstract |
|