Editing Computable function (section)

==References==
{{reflist}}
*Cutland, Nigel. ''Computability''. Cambridge University Press, 1980.
*[[Herbert Enderton|Enderton, H.B.]] Elements of recursion theory. ''Handbook of Mathematical Logic'' (North-Holland 1977) pp.&nbsp;527–566.
*Rogers, H. ''Theory of recursive functions and effective computation'' (McGraw–Hill 1967).
*[[A. Turing|Turing, A.]] (1937), [https://academic.oup.com/plms/issue/s2-42/1 On Computable Numbers, With an Application to the Entscheidungsproblem]. ''Proceedings of the London Mathematical Society'', Series 2, Volume 42 (1937), p.230–265. Reprinted in M. Davis (ed.), ''The Undecidable'', Raven Press, Hewlett, NY, 1965.

{{ComplexityClasses}}
{{Mathematical logic}}

[[Category:Computability theory]]
[[Category:Theory of computation]]