1. S. Bellantoni and S. Cook, A new recursive characterization of the polytime funcions, in 24th Annual ACM STOC (1992) 283–293.
2. S. Caporaso, Safe Turing machines, Grzegorczyk classes and Polytime (to appear on Intern. J. Found. Comp. Sc.).
3. S. Caporaso and M. Zito, On a relation between uniform coding and problems of the form DTIME(F)=? DSPACE(F), submitted to Acta Informatica.
4. P. Clote, A time-space hierarchy between polynomial time and polynomial space, Math. Systems Theory, 25(1992) 77–92.
5. A. Cobham, The intrinsic computational complexity of functions, in Y. Bar Hillel, ed., Proc. Int. Conf. Logic, Methodology and Philosophy Sci. (North-Holland, Amsterdam, 1965) 24–30.