Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A. Amihud and Y. Choueka. Loop programs and polinomially computable functions. International Journal of Computer Mathematics, Section A, 9:195–205, 1981.
2. R. M. Burstall and John Darlington. A transformation system for develloping recursive programs. Journal of the Association for Computing Machinery, 24(1):44–67, 1977.
3. Howard Blair, Wiktor Marek, Anil Nerode, and Jeffrey Remmel, editors. Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic programming, Washigton DC, 1992.
4. John C., Cherniavsky. Simple programs realize exactly Presburger formulas. SIAM Journal on Computing, 5:666–677, 1976.
5. C. A. R. Hoare and D. C. S. Allison. Incomputability. Computing Surveys, 4:169–178, 1972.