Abstract
Turing's machines of 1936 were a purely mathematical notion, not an exploration of possible blueprints for physical calculators.
- Aspray, W. John von Neumann and the Origins of Modern Computing. MIT Press, Cambridge, MA, 1990.Google ScholarDigital Library
- Booker, A.R. Turing and the primes. In The Once and Future Turing: Computing the Worldy, S.B. Cooper and A. Hodges, Eds. Cambridge University Press, Cambridge, U.K., 2016, 34--50. Google ScholarCross Ref
- Bruderer, H. Meilensteine der Rechentechnik. Zur Geschichte der Mathematik und der Informatik. De Gruyter Oldenbourg, Berlin/Boston, 2015. Google ScholarCross Ref
- Church, A. Review: A.M. Turing, on computable numbers, with an application to the Entscheidungsproblem. Journal of Symbolic Logic 2, 1 (1937), 42--43.Google Scholar
- Comrie, L.J. The application of the Hollerith tabulating machine to Brown's tables of the moon. Monthly Notices of the Royal Astronomical Society 92, 7 (1932), 694--707. Google ScholarCross Ref
- Copeland, B.J., Ed. The Essential Turing. Clarendon Press, Oxford, 2004.Google ScholarCross Ref
- Copeland, B.J., Ed. Alan Turing's Automatic Computing Engine. The Master Codebreaker's Struggle to Build the Modern Computer. Oxford University Press, Oxford, U.K., 2005. Google ScholarCross Ref
- Copeland, B.J. and Proudfoot, D. Alan Turing: Father of the modern computer. Rutherford Journal 4 (2011--2012).Google Scholar
- Copeland, B.J. and Sommaruga, G. The stored-program universal computer: Did Zuse anticipate Turing and von Neumann? In Turing's Revolution. The Impact of His Ideas about Computability, G. Sommaruga and T. Strahm, Eds. Springer International Publishing, Cham, Switzerland, 2015, 43--101. Google ScholarCross Ref
- Croarken, M. Table making by committee: British table makers 1371--1965. In The History of Mathematical Tables: From Sumer to Spreadsheets, R.F.M. Campbell-Kelly, M. Croarken, and E. Robson, Eds. Oxford University Press, Oxford, U.K., 2003, 235--267. Google ScholarCross Ref
- Daylight, E.G. A Turing tale. Commun. ACM, 57, 10 (Oct. 2014), 36--38. Google ScholarDigital Library
- Daylight, E.G. Towards a historical notion of 'Turing: The father of computer science.' History and Philosophy of Logic 36, 3 (Sept. 2015), 205--228. Google ScholarCross Ref
- DeMol, L. Closing the circle: An analysis of Emil Post's early work. The Bulletin of Symbolic Logic 12, 2 (June 2006), 267--289. Google ScholarCross Ref
- Feferman, S. Turing's thesis. Notices of the American Mathematical Society 53, 10 (Nov. 2006), 2--8.Google Scholar
- Haigh, T. Actually, Turing did not invent the computer. Commun. ACM 57, 1 (Jan. 2014), 36--41. Google ScholarDigital Library
- Haigh, T., Priestley, M., and Rope, C. Reconsidering the stored-program concept. IEEE Annals of the History of Computing 36, 1 (Jan.-Mar. 2014), 4--17. Google ScholarCross Ref
- Hejhala, D.A. and Odlyzko, A.M. Alan Turing and the Riemann zeta function. In Alan Turing: His Work and Impact, S.B. Cooper and J. van Leeuwen, Eds. Elsevier Science, Waltham, MA, 2013, 265--279.Google Scholar
- Hodges, A. The Alan Turing Internet Scrapbook. Who Invented the Computer?; http://www.turing.org.uk/scrapbook/computer.htmlGoogle Scholar
- Hodges, A. Alan Turing: The logical and physical basis of computing. In Proceedings of the 2004 International Conference on Alan Mathison Turing: A Celebration of his Life and Achievements (Swinton, U.K.). British Computer Society, London, U.K., 2004.Google Scholar
- Hodges, A. Did Turing have a thesis about machines? In Church's Thesis After 70 Years, J.W.A. Olszewski and R. Janusz, Eds. Ontos Verlag, Frankfurt am Main, Germany, 2006, 242--252.Google Scholar
- Hodges, A. Alan Turing: The Enigma. The Book that Inspired the Film 'The Imitation Game.' Princeton University Press, Princeton, NJ, 2014. Google ScholarCross Ref
- Sieg, W. Gödel on computability. Philosophia Mathematica 14, 2 (Jan. 2006), 189--207. Google ScholarCross Ref
- Small, J.S. The Analogue Alternative: The Electric Analogue Computer in Britain and the USA, 1930--1975. Routledge, London, U.K., 2001.Google Scholar
- Titchmarsh, E.C. The zeros of the Riemann zeta-function. Proceedings of the Royal Society of London. Series A, Mathematical, Physical and Engineering Sciences 151, 873 (Sept. 1935), 234--255. Google ScholarCross Ref
- Titchmarsh, E.C. The zeros of the Riemann zeta-function. Proceedings of the Royal Society of London. Series A, Mathematical, Physical and Engineering Sciences 157, 891 (Nov. 1936), 261--263. Google ScholarCross Ref
- Turing, A.M. Proposed Electronic Calculator (report submitted to the Executive Committee of the National Physical Laboratory), 1945; republished in Copeland, B.J, Ed.,<zref=R7>7<zrefx> 369--454.Google Scholar
- Turing, A.M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42, 1 (Nov. 1937), 230--265. Google ScholarCross Ref
- Turing, A.M. Systems of logic based on ordinals. Proceedings of the London Mathematical Society 45, 1 (Jan. 1939), 161--228. Google ScholarCross Ref
- Turing, A.M. Some calculations of the Riemann zeta-function. Proceedings of the London Mathematical Society 3, 3 (Jan. 1953), 99--117. Google ScholarCross Ref
- von Neumann, J. First Draft of a Report on the EDVAC. Technical Report. University of Pennsylvania, Philadelphia, PA, 1945. Google ScholarCross Ref
- Watson A.G.D. Mathematics and its foundations. Mind 47, 188 (Oct. 1938), 440--451. Google ScholarCross Ref
Index Terms
- Turing's pre-war analog computers: the fatherhood of the modern computer revisited
Recommendations
Some properties of one-pebble turing machines with sublogarithmic space
This paper investigates some aspects of the accepting powers of deterministic, nondeterministic, and alternating one-pebble Turing machines with spaces between log log n and log n. We first investigate a relationship between the accepting powers of two-...
Weak synchronization and synchronizability of multi-tape pushdown automata and turing machines
Given an n-tape automaton M with a one-way read-only head per tape which is delimited by an end marker $ and a nonnegative integer k, we say that M is weakly k-synchronized if for every n-tuple x = (x1,..., xn) that is accepted, there is an accepting ...
Comments