1. Meyer, A.R. and D.M.Ritchie, The complexity of loop programs. Proc. 22nd ACM National Meeting (1967), 465–469.
2. Meyer, A.R. and D.M.Ritchie, Computational complexity and program structures. IBM research paper RC-1817, Watson Research Center, 1967.
3. Kalmár, L., Egyszerü példa eldönthetetlen aritmetikai problémára. Matematikai és Fizikai Lapok 50 (1943), 1–23.
4. Kasai, T. and A.Adachi, A characterization of time complexity by simple loop programs. Technical report RIMS-250, Research Institute for Math. Sci., Kyoto Univ., 1978.
5. Brainerd, W.S. and L.H. Landweber, Theory of Computation. Wiley, New York, 1974.