This paper considers theories of bounded arithmetic which are predicative in the sense of Nelson, that is, theories which are interpretable in Robinson’s Q . We give a nearly exact characterization of functions which can be total in predicative bounded theories. As an upper bound, any such function has polynomial growth rate and its bit-graph is in nondeterministic exponential time and in co-no...