Hostname: page-component-84b7d79bbc-dwq4g Total loading time: 0 Render date: 2024-07-28T13:14:39.105Z Has data issue: false hasContentIssue false
  • English
  • Français

1936: Post, Turing and ‘a kind of miracle’ in mathematical logic

Published online by Cambridge University Press:  01 August 2016

G. T. Q. Hoare
G. T. Q. Hoare*
Affiliation:
3 Russett Hill, Chalfont St Peter SL9 8JY
Get access Rights & Permissions [Opens in a new window]

Extract

In the 1930s several mathematicians, principally Alonzo Church (1903-1995), Stephen Kleene (1909-1994), Emil Post (1897-1954) and Alan Turing (1912-1954), began investigating the notion of effective calculability. (A function from natural numbers to natural numbers is effectively calculable if there is some finite rule or mechanism which will calculate the value of the function for any natural number.) Central to this activity was the notion of recursiveness. Loosely, recursion is a process of defining a function by specifying each of its values in terms of previously defined values.

Type
Articles
Information
The Mathematical Gazette , Volume 88 , Issue 511 , March 2004 , pp. 2 - 15
Copyright
Copyright © The Mathematical Association 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Hoare, G. T. Q. A survey of mathematical logic, part II: post-1931. Math. Gaz. 80 (July 1996) pp. 286–297.Google Scholar
2. Skolem, Th. Foundation of elementary arithmetic by means of the recursive mode of thought, without application of apparent variables with an infinite range of extension (1923).Google Scholar
3. Feferman, Solomon (editor), Kurt Gödel, Collected Works, Volume II. Publications 1938–1974 Oxford University Press (2001) pp. 150–153.Google Scholar
4. Emil Post, Polyadic Groups. Trans. Amer. Math. Soc., 48 (1940). Reprinted in Solvability, Provability, Definability. The Collected Works of Emil L. Post, Davis, Martin (ed.), Birkhäuser (1994) pp. 106–249.Google Scholar
5. Post, Emil L. Absolutely unsolvable problems and relatively undecidable propositions – account of an anticipation . Published in Davis, M. (ed.), The undecidable, Raven Press, New York (1965) pp. 340–433 and in [4] pp. 375–441.Google Scholar
6. Post, Emil Formal reductions of the General Combinatorial Decision Problem, Amer. J. Math., 65 (1943) pp. 197–215. Reprinted in [4] pp. 442–460.Google Scholar
7. Post, Emil Finite combinatory processes – formulation I, J. Symb. Logic, 1 (1936) pp. 103–105. Reprinted in [4] pp. 103–105.Google Scholar
8. Post, Emil Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc., 50 (1944) pp. 284–316. Reprinted in [4] pp. 461–494.Google Scholar
9. Turing, A. M. Systems of logic based on ordinals. P. Lond. Math. Soc. (2) 45 (1939) pp. 161–228.Google Scholar
10. Post, Emil Degrees of recursive unsolvability: preliminary report (abstract) Bull. Amer. Math. Soc., 54 (1948) pp. 641–642. Reprinted in [4] pp. 549–550.Google Scholar
11. Friedberg, R. M. Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem, 1944). Proc. Nat. Acad. Sci. U.S.A., 43 (1957) pp. 236–238.Google Scholar
12. Mucnik, A. A. On the unsolvability of the problem of reducibility in the theory of algorithms (Russian), Doklady Akademii Nauk SSSR, 108, (1956) pp. 194–197.Google Scholar
13. Post, Emil A variant of a recursively unsolvable problem, Bull. Amer. Math. Soc., 52 (1946) pp. 264–268. Reprinted in [4] pp. 495–500.Google Scholar
14. Post, Emil Recursive unsolvability of a problem of Thue, J. Symb. Logic, 12 (1947), pp. 1–11. Reprinted in [4] pp. 503–512.Google Scholar
15. Hodges, Andrew Alan Turing: The Enigma (1983) Burnett Books.Google Scholar
16. Church, A. A note on the Entscheidungsproblem, J. Symb. Log. 1 (1936) pp. 40–41; correction, ibid., pp. 101–102.Google Scholar
17. Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem, P. Lond. Math. Soc. (2) 42 (1936–37) pp. 230–265. Reprinted in [5], and also more recently vol. 4 of [23].Google Scholar
18. Welchman, Gordon The hut six story. Breaking the Enigma codes. M. and M. Baldwin (2000).Google Scholar
19. Sebag-Montefiore, Hugh Enigma. The battle for the code. A Phoenix Paperback (2001).Google Scholar
20. Thomson, D’Arcy On growth and form, Cambridge University Press, Cambridge (1917).Google Scholar
21. Turing, A. M. The chemical basis of morphogenesis, Phil. Trans. R. Soc. London B237, (1952), pp. 37–72.Google Scholar
22. Turing, A. M. A diffusion reaction theory of morphogenesis in plants (with C. W. Wardlaw) – published posthumously in the third volume of [23]. The preceding paper is reproduced in that volume.Google Scholar
23. Collected Works of A. M. Turing, Elsevier, Amsterdam, 1 (1991) – 4 (2001).Google Scholar