Heller M, Woodin W.H. (eds.) Infinity. New research frontiers (CUP, 2011)(ISBN 1107003873)(O)(327s)_MAml_

eferences 75Gamow, G. 1947. One, Two, Three . . . Infinity: Facts and Speculations of Science. Illustrated byauthor. Rev. ed. 1961. London: Macmillan.Gardner, M. 1975. Mathematical Carnival. New York: Borzoi Books, Alfred A. Knopf. p. 264.http://www-groups.dcs.st-and.ac.uk/∼history/Mathematicians.Geymonat, M. 2006. Il grande Archimede. 2nd ed. Roma: Sandro Teti Editore.Netz, R., Saito, K., and Tchernetska, N. 2001. A new reading of Method Proposition 14: Preliminaryevidence from the Archimedes palimpsest. I. Source and Commentaries in Exact Sciences 2: 9–29.Nygrén, A. 2001. A simple solution to Archimedes’ cattle problem. University of Oulu, Linnanmaa,Oulu, Finland. Acta Universitatis, Ouluensis, Scientiae Rerum Naturalium. http://herkules.oulu.fi/isbn9514259327/index.html?tulosta=yes.Paris, J., and Harrington, L. 1977. A mathematical incompleteness in Peano arithmetic. In Proof Theoryand Constructive Mathematics, with contributions by C. Smorynski, Helmut Schwichtenberg,Richard Statman, et al. Handbook of Mathematical Logic, part D, pp. 819–1142. Studies in Logicand the Foundations of Math, vol. 90. Amsterdam: North-Holland.Radó, T. 1962. On non-computable functions. Bell System Technical Journal 41: 877–84.Lin, S., and Radó, T. 1965. Computer studies of Turing machine problems. Journal of the Associationof Computing Machinery 12: 196–212.Shor, P. W. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In 35thAnnual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, pp. 124–34. LosAlamitos, CA: IEEE Computer Society Press.Terjanian, G. 1966. Un contre-example à une conjecture d’Artin. Compte Rendus de L’Académie desSciences Paris Séries A-B 262: A612.Vardi, I. 1998. Archimedes’ cattle problem. American Mathematical Monthly 105: 305–19.