Placid Platypus

From BusyBeaverWiki
Revision as of 16:08, 28 September 2026 by Sligocki (talk | contribs) (Comment about LB connection.)
Jump to navigation Jump to search

The Placid Platypus function PP(n) [1] is the minimal number of states of 2-symbol Turing machines that print exactly n ones when halt.

PP(n)≤n, because you can print each 1 in a state. Also if n>Σ(m), then PP(n)>m. On the other side, there is also a connection to Lazy Beaver: if n<LB(m) then PP(n)≤m.

Values

n PP(n) TM
1 1 1RZ--- (bbch)
2 2 1RB---_1RZ--- (bbch)
3 2 1RB1LA_1LA1RZ (bbch)
4 2 1RB1LB_1LA1RZ (bbch)

References