[FOM] History of computable functions

[Sandro]

Maybe it is a bit off the main topic, but nevetheless this paper is quite 
interesting from a historical point of view, and does come across 
computability issues:

Mints, G. Proof theory in the USSR: 1925-1969. JSL, Vol. 56, No. 2, (June 
1991), pp. 385--424.


Sandro Skansi





----- Original Message ----- 
From: "Arnold Neumaier" <Arnold.Neumaier at univie.ac.at>
To: "Foundations of Mathematics" <fom at cs.nyu.edu>
Sent: Thursday, November 05, 2009 4:30 PM
Subject: Re: [FOM] History of computable functions


> Billy Hudson wrote:
>> 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
>> Mathematics",
>> 3rd edition,
>> Published by Advanced Reasoning Forum (ARF)
>> 2008
>> ISBN: 978-0-9815507-2-5
>>
>> The text itself is replete with historical and philosophical discussions
>> that accompany the technical details.
>
> A review of the book and the Apopendix is at
> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.3677&rep=rep1&type=pdf
>
>
> Arnold Neumaier
>
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom
>
>
> __________ ESET NOD32 Antivirus informacija, verzija baze podataka 
> virusnih potpisa 4548 (20091027) __________
>
> poruka je provjerena programom ESET NOD32 Antivirus.
>
> http://www.eset.com.hr
>
>
>