Program size in restricted programming languages

Let h be any rapidly increasing function recursive in the halting problem. One can find a double recursive program of size n for a zero—one valued function of finite support whose smallest primitive recursive program is larger than h(n). One can find a general recursive program of size n for a zero—one valued function of finite support such that any general recursive program of size at most h(n) for the function runs extremely slowly on all large arguments