||addictive adder||-- ||--
||busy beaver||function||largest number of 1's printed by a terminating machine with n states.
||busy beaver||machine||a terminating machine whose productivity is the busy beaver function
||dizzy duck||heuristic||see below
||dizzy duck||machine||a non-terminating machine whose induction proof requires the dizzy duck heuristic
||frantic frog||function ||largest number of state transitions by a terminating machine with n states.
||frantic frog||machine ||a terminating machine whose number of state transitions is the frantic frog function
||ignoble iguana||machine||a machine which can be ignored in the search for busy beavers and placid platypodes. Includes road runners, perennial pigeons and phlegmatic phoenices.
||killer kangaroo||machine ||a machine whose non-termination proof requires a multplicative hypothesis
||maniacal monkey||heuristic ||see below
||maniacal monkey||machine ||a machine whose non-termination proof requires the maniacal monkey heuristic
||meandering meerkat||machine||a machine whose halt transition is unreachable from an all-blank input
||perennial pigeon||machine ||a machine which repeats a tape configuration
||phlegmatic phoenix||machine ||a machine which returns the tape to all blanks at some point in the computation
||placid platypus||function ||smallest number of states required to print n 1's with a terminating machine
||placid platypus||machine ||a terminating machine whose number of states is the placid platypus function and which prints the requisite number of 1's
||road runner||machine ||a machine which moves infinitely in a single direction
||slithery snake||heuristic ||see below
||slithery snake||machine ||a non-terminating machine whose non-termination proof requires the slithery snake heuristic
||terminating termite||machine ||a machine which terminates
||unknown unicorn||machine ||a machine whose classification is as yet unknown
||wild wombat||heuristic||see below
||wild wombat||machine||a non-terminating machine whose non-termination proof requires only the wild wombat heuristic
||weary wombat||function ||the mininum number of state transitions required to print n 1's.
||weary wombat||machine ||a machine whose number of state transition is given by the weary wombat function.