Placid Platypus
The Placid Platypus function [1] is the minimal number of states of 2-symbol Turing machines that print exactly n ones when halt.
, because you can print each 1 in a state. Also if , then .
References
- ↑ James Harland. The Busy Beaver, the Placid Platypus and other Crazy Creatures. 2006.