[FOM] History of computable functions
billyhudson at boisestate.edu
Wed Nov 4 15:17:50 EST 2009
Epstein and Carnielli provide a 28 page annotated timeline, "Computability
and Undecidability a Timeline: The story of the development of the theory of
computable functions and the undecidability of arithmetic to 1970" in the
back of their book:
"Computability: Computable Functions, Logic, and the Foundations of
Published by Advanced Reasoning Forum (ARF)
The text itself is replete with historical and philosophical discussions
that accompany the technical details.
On Wed, Nov 4, 2009 at 1:12 AM, Andrej Bauer <andrej.bauer at andrej.com>wrote:
> A student of mine is working on a seminar in which he will show in
> excruciating detail that the general recursive functions embed in
> untyped lambda calculus (this is at undergraduate level). He would
> like to know more about the history of computable functions, lambda
> calculus, Turing machines, etc., with a reasonably correct timeline of
> who did what when. Can someone please suggest some reading material?
> Andrej Bauer
> FOM mailing list
> FOM at cs.nyu.edu
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the FOM