The weary wombat function, denoted \(\text{WW}(n)\), is an "inverse" of the frantic frog function.[1] \(\text{WW}(n)\) is defined as the minimum number of steps taken before halting by an \(n\)-state machine that prints \(\text{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.

Sources Edit


Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.