Placid Platypus

From BusyBeaverWiki
Revision as of 15:16, 28 September 2026 by Loader3229 (talk | contribs) (Created page with "The '''Placid Platypus''' function <math>PP(n)</math> <ref>James Harland. [https://dl.acm.org/doi/pdf/10.5555/1151785.1151794 The Busy Beaver, the Placid Platypus and other Crazy Creatures]. 2006.</ref> is the minimal number of states of 2-symbol Turing machines that print exactly n ones when halt. <math> PP(n) \leq n </math>, because you can print each 1 in a state. Also if <math> n > \Sigma(m)</math>, then <math> PP(n) > m </math>. == References == <references /> ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.


References