An Early History of Recursive Functions and Computability: From Gödel to Turing

Portada
Docent Press, 2011 - 297 páginas
0 Reseńas
Las reseńas no se verifican, pero Google comprueba si hay contenido falso y lo retira una vez identificado
An Early History of Recursive Functions and Computability traces the development of recursive functions from their origins in the late nineteenth century, when recursion was first used as a method of defining simple arithmetic functions, up to the mid-1930's, when the class of general recursive functions was introduced by Godel, formalized by Kleene and used by Church in his thesis. The book explains how the proposal given in Church's 1936 paper, now known as Church's thesis, first arose and concludes with the consideration of another class of functions, the Turing computable functions, that were specially created to be equivalent to the class of effectively calculable functions. The book includes previously unpublished letters between the author and many of the key historical figures.
 

Comentarios de usuarios - Escribir una reseńa

No hemos encontrado ninguna reseńa en los sitios habituales.

Índice

I
1
II
19
III
33
IV
73
V
105
VI
147
VII
189
Página de créditos

Términos y frases comunes

Sobre el autor (2011)

Rod Adams received his PhD from the School of Information Sciences at The Hatfield Polytechnique under the supervision of Dr. Dale Johnson. Dr. Adams is currently a Professor of Neural Computation at the University of Hertfordshire.

Información bibliográfica