Theory of Computation

Bibliography

P. Axt. Iteration of Primitive Recursion. Zeitschrift für math. Logik, 11:253–255, 1965.

J. Bennett. On Spectra. PhD thesis, Princeton University, 1962.

E. Blum. A machine-independent theory of the complexity of recursive functions. ACM, 14:322–336, 1967.

N. Bourbaki. Éléments de Mathématique; Théorie des Ensembles. Hermann, Paris, 1966.

A. Church. A note on the Entscheidungsproblem. J. Symbolic Logic, 1:40–41, 101–102, 1936a.

A. Church. An unsolvable problem of elementary number theory. Amer. Journal of Math., 58:345–363, 1936b. [Also in Davis (1965), 89–107].

A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, International Congress for Logic, Methodology and Philosophy of Science, pp. 24–30. North-Holland, Amsterdam, 1964.

S. Cook. The complexity of theorem-proving procedures. In Proceedings, 3rd ACM Symposium on Theory of Computing, pp. 151–158, 1971.

M. Davis. Computability and Unsolvability. McGraw-Hill, New York, 1958.

M. Davis. The Undecidable. Raven Press, Hewlett, NY, 1965.

R. Dedekind. Was sind und was sollen die Zahlen? Vieweg, Braunschweig, 1888. [In English translation by W.W. Beman; cf. Dedekind (1963)].

R. Dedekind. Essays on the Theory of Numbers. Dover Publications, New York, 1963. [First English edition translated by W.W. Beman and published by Open Court Publishing, 1901].

H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.

K. Gödel. Die Vollständigkeit der Axiome des logischen ...