Weary wombat function

The weary wombat function, denoted \(\text{WW}(n)\), is an "inverse" of the frantic frog function.James Harland (2016) Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) Theoretical Computer Science 646, 20: 61-85.
James Harland. The Busy Beaver, the Placid Platypus and other Crazy Creatures Twelfth Computing: Australasian Theory
Symposium, Hobart (2006) (Archived from the original on 2016-08-20) \(\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 HarlandJames Harland at RMIT University, Australia
, as part of his Zany Zoo Turing machine research projectJames Harland. The Busy Beaver, the Placid Platypus and other Crazy Creatures.
== Sources ==
== See also ==
Category:Functions
Category:Zany Zoo
Category:Numbers based off of the busy beaver