Dr Máté Szabó
Kalmár's Argument Against the Plausibility of Church's Thesis
In his famous paper, An Unsolvable Problem of Elementary Number Theory , Alonzo Church (1936) identified the intuitive notion of effective calculability with the mathematically precise notion of recursiveness. This proposal, known as Church's Thesis, has been widely accepted. Only a few papers have been written against it. One of these is László Kalmár's An Argument Against the Plausibility of Church's Thesis from 1959. The aim of this paper is to present Kalmár's argument and to fill in missing details based on his general philosophical thoughts on mathematics.
History and Philosophy of Logic, 2018, Vol. 39, No. 2, 140-157.
From the West to the East and Back Again: Hungary’s Early Years in the Ryad. Forthcoming in the IEEE Xplore Digital Library, SoRuCom 2020
Kalmár's Argument Against the Plausibility of Church's Thesis. History and Philosophy of Logic, 2018, Vol. 39, No. 2, 140-157. Accessible online at: https://doi.org/10.1080/01445340.2017.1396520
with Wilfried Sieg and Dawn McLaughlin, Why Post did [not] have Turing’s Thesis. Omodeo and Policriti (eds): Martin Davis on Computability, Computational Logic,and Mathematical Foundations, Springer, 2017, 175-208