ARITHMOS
ARITHMOS Readings In The History of Mathematics from Original Sources
Readings for meeting #14, June 19-20, 2004
DIFFERENT LOCATION --- Warner Hall room 315
Twentieth Century Logic
Alonzo Church and the Notion of effective calculability
An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics 56 (1936) p 345-363
We will read an extract (in .pdf form) from Chabert, History of Algorithms, unless we can make a complete copy available.
Added Wednesday, June 9: Complete original text of the Church Calculability article
Added Wednesday, June 9: Complete text from Martin Davis' sourcebook in logic of the Church Calculability article
Alan Turing and The Turing Machine
On Computable numbers with an Application to the Entscheidungsproblem
Proceedings of the London Mathematical Society, II.42 (1936-37) p 230-256
Two versions available: One, with a black background, and another that might print out better.
Added Wednesday, June 9: Complete text from Martin Davis' sourcebook in logic of the Turing Machine article
Added Wednesday, June 16: Complete original text of the Turing Machine article.
Post and Post's Machine
Finite Combinatory Processes, Formulation I, The Journal of Symbolic Logic, 1 (1936) p 103-105
We use an extract from Chabert, again, unless we can find a complete copy
Added Tuesday, June 8: Complete original text of the Post's Machine article
Added Wednesday, June 9: Complete text from Martin Davis' sourcebook in logic of the Post Machine article
Added Wednesday, June 9: Complete text from Martin Davis' sourcebook in logic Post's commentary on the Turing Machine article