And it turns out that if they never sample values below f[0] the functions in the main text are also all primitive recursive.

(In most PCP systems, including all the examples shown except (a) and (g), one string is always systematically longer than the other.)