The weary wombat function, denoted \(\text{WW}(n)\), is an "inverse" of the frantic frog function.[1] [2] \(\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[3] , as part of his Zany Zoo Turing machine research project[4].
Sources[]
- ↑ 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)
- ↑ James Harland at RMIT University, Australia
- ↑ James Harland. The Busy Beaver, the Placid Platypus and other Crazy Creatures
See also[]
Large numbers in computers
Main article: Numbers in computer arithmetic
127 · 128 · 256 · 32767 · 32768 · 65536 · 2147483647 · 4294967296 · 9007199254740991 · 9223372036854775807 · FRACTRAN catalogue numbersBignum Bakeoff contestants: pete-3.c · pete-9.c · pete-8.c · harper.c · ioannis.c · chan-2.c · chan-3.c · pete-4.c · chan.c · pete-5.c · pete-6.c · pete-7.c · marxen.c · loader.c
Channel systems: lossy channel system · priority channel system
Concepts: Recursion