1. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 103–112. ACM, Chicago (1988)
2. Brainerd, W.S., Landweber, L.H.: Theory of Computation, 1st edn. Wiley, New York (1974)
3. Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress. Studies in Logic and the Foundations of Mathematics, pp. 24–30. North-Holland Publishing, Cambridge (1965)
4. Davis, M.: The Undecidable, Basic Papers on Undecidable Propositions, Unsolvable Problems And Computable Functions, 1965th edn. Raven Press, New York (1965)
5. Theory and Applications of Computability;RG Downey,2010