Placid platypus function

The placid platypus function, denoted \(\text{PP}(n)\), is an "inverse" of the busy beaver function. \(\text{PP}(n)\) is defined as the minimal number of states needed for a TM that prints a string of \(n\) ones and halts. It was first investigated and named by James Harland, as part of his "Zany Zoo" Turing machine research project.