A characterization of time complexity by simple loop programs

A. Adachi, A relation between space complexity and the largest number, in preparation. Borodin, 1973, Computational complexity: Theory and practice, 35 Constable, 1970, On the size of programs in subrecursive hierarchies, 1 Constable, 1970, On the efficiency of programs in subrecursive formalisms, 60 Cook, 1973, Time bounded random access machines, J. Comput. System. Sci., 7, 354, 10.1016/S0022-0000(73)80029-7 Goetze, 1978, Loop Programs and Classes of Primitive Recursive Functions, Lecture Notes, Mathematical Foundations of Computer Science No. 78, 10.1007/3-540-08921-7_70 Grzegorczyk, 1953, Some Classes of Recursive Functions, 1 Jones, 1977, Even simple programs are hard to analyze, J. Assoc. Comput. Mach., 24, 338, 10.1145/322003.322016 Kasai, 1977, Computational complexity of multitape Turing machines and random access machines, Publ. RIMS, Kyoto Univ., 13, 469, 10.2977/prims/1195189815 Kasai, 1977, P = NP question on program schemata Kasai, 1979, A theoretical study on the time analysis of programs Meyer, 1967, The complexity of loop programs, 465