Abstract
The concept of algorithm, i. e. of a “general procedure”, is more or less known to all mathematicians. In this introductory paragraph we want to make this concept more precise. In doing this we want to stress what is to be considered essential.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lorenzen, P.: Einführung in die operative Logik und Mathematik. Berlin-Göttingen-Heidelberg: Springer 1955.
Curry, H. B.: Calculuses and Formal Systems. Logica, Studia Paul Bernays dedicata, pp. 45–69. Neuchâtel: Editions du Griffon 1959. See also: Dialectica 12, 249–273 (1958).
Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Mh. Math. Phys. 38, 173–198 (1931).
Menninger, K.: Zahlwort und Ziffer I, II. Göttingen: Vandenhoeck & Ruprecht 1957, 1958.
Post, E. L.: Finite Combinatory Processes — Formulation 1. J. symbolic Logic 1, 103–105 (1936).
Turing, A. M.: On Computable Numbers, with an Application to the Entscheidungsproblem. Proc. London math. Soc. (2) 42, 230–265 (1937).
Turing, A. M.: On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction. Proc. London. math. Soc. (2) 43, 544–546 (1937).
Wang, H.: A Variant to Turing’s Theory of Computing Machines. J. Assoc. Computing Mach. 4, 63–92 (1957).
Kalmar, L.: An Argument against the Plausibility of Church’s Thesis. Constructivity in Mathematics, ed. by A. Hevting, pp. 72–80. Amsterdam: North-Holland Publishing Company 1959.
Peter, R.: Rekursivität und Konstruktivität. Ibid., pp. 226–233.
Turing, A. M.: Computing Machinery and Intelligence. Mind 59, 433–460 (1950).
Kemeny, J. G.: Man Viewed as a Machine. Sci. Amer. 192, 58–67 (1955).
Finslex, P.: Formale Beweise und die Entscheidbarkeit. Math. Z. 25, 676–682 (1926).
Gödel, K.: Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Mh. Math. Phys. 37, 349–360 (1930).
Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Mh. Math. Phys. 38, 173–198 (1931). (Incompleteness theorem.)
Church, A.: An Unsolvable Problem of Elementary Number Theory. Amer. J. Math. 58, 345–363 (1936). (Church’s thesis on p. 346.)
Kleene, S. C.: General Recursive Functions of Natural Numbers. Math. Ann. 112, 727–742 (1936).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1969 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Hermes, H. (1969). Introductory Reflections on Algorithms. In: Enumerability · Decidability Computability. Die Grundlehren der mathematischen Wissenschaften, vol 127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46178-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-46178-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-46180-4
Online ISBN: 978-3-642-46178-1
eBook Packages: Springer Book Archive