NOTES TO PAGES 457–465 | 529
(2002), 281–300. The term ‘accelerating Turing machine’ was introduced by Copeland in lectures
in 1997. The variant term ‘accelerated Turing machine’ (see e.g. C. S. Calude and L. Staiger, ‘A note
on accelerated Turing machines’, Centre for Discrete Mathematics and Theoretical Computer Science
Research Reports (2009) (http://hdl.handle.net/2292/3857); L. G. Fearnley, ‘On accelerated Turing
machines’, Honours Thesis in Computer Science (2009), University of Auckland; P. H. Potgieter and
E. Rosinger, ‘Output concepts for accelerated Turing machines’, Centre for Discrete Mathematics and
Theoretical Computer Science Research Reports (2009) (http://hdl.handle.net/2292/3858)) originated
in Copeland’s ‘Even Turing machines can compute uncomputable functions’.- B. A. W. Russell, Our Knowledge of the External World as a Field for Scientific Method in Philosophy,
Open Court (1915), pp. 172–3. - B. J. Copeland and O. Shagrir, ‘Do accelerating Turing machines compute the uncomputable?’ Minds
and Machines, 21 (2011), 221–39. - The conference papers were published in 1990: I. Pitowsky, ‘The physical Church thesis and physical
computational complexity’, Iyyun, 39 (1990), 81–99. - H. Andréka, I. Németi, and P. Németi, ‘General relativistic hypercomputing and foundation of math-
ematics’, Natural Computing, 8 (2009), 499–516; I. Németi and G. Dávid, ‘Relativistic computers
and the Turing barrier’, Applied Mathematics and Computation, 178 (2006), 118–42; G. Etesi and
I. Németi, ‘Non-Turing computations via Malament–Hogarth space–times’, International Journal
of Theoretical Physics, 41 (2002), 341–70. David Malament (in private communications) and Mark
Hogarth have described essentially similar setups: M. L. Hogarth, ‘Does general relativity allow an
observer to view an eternity in a finite time?’, Foundations of Physics Letters, 5 (1992), 173–81, M. L.
Hogarth, ‘Non-Turing computers and non-Turing computability’, PSA: Proceedings of the Biennial
Meeting of the Philosophy of Science Association, 1 (1994), 126–38. - Andréka, Németi, and Németi (Note 44), p. 501.
- Andréka, Németi, and Németi (Note 44), p. 511.
- M. Bunge and R. Ardila, Philosophy of Psychology, Springer-Verlag (1987), p. 109.
- D. Deutsch, ‘Quantum theory, the Church–Turing principle and the universal quantum computer’,
Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, 400 (1985),
97–117 (p. 99). - R. Penrose, Shadows of the Mind: a Search for the Missing Science of Consciousness, Oxford University
Press (1994), p. 21. - A. Hodges, Alan Turing: the Enigma, Vintage (1992), p. 109.
- A. Hodges, ‘What would Alan Turing have done after 1954?’, in C. Teuscher (ed.), Alan Turing: Life
and Legacy of a Great Thinker, Springer-Verlag (2003), p. 51. - B. J. Copeland and D. Proudfoot, ‘Alan Turing’s forgotten ideas in computer science’, Scientific
American, 280 (1999), 99–103. - A. M. Turing (1951), ‘Can digital computers think?’, first published in B. J. Copeland, ‘A lecture
and two radio broadcasts on machine intelligence by Alan Turing’, in K. Furukawa, D. Michie, and
S. Muggleton (eds), Machine Intelligence 15, Oxford University Press (1999), pp. 445–76; also in The
Essential Turing. - Copeland (Note 53), pp. 451–2. See also B. J. Copeland, ‘Turing and the physics of the mind’, in S. B.
Cooper and J. van Leeuwen (eds), Alan Turing: His Work and Impact, Elsevier (2013), 651–66. - A. Hodges, ‘What would Alan Turing have done after 1954?’, Lecture at the Turing Day, Lausanne,
Switzerland (June 2002). - Turing (1951), p. 483.
- A. Hodges, ‘Beyond Turing’s machines’, Science, 336 (13 April 2012), 163–4.
CHAPTER 42 TURING’S lEGACy (BOwEN AND COPElAND)
- ‘The great minds of the century’, Time, 153(12) (29 March 1999) (http://content.time.com/time/
magazine/article/0,9171,990608,00.html); P. Gray, ‘Computer scientist: Alan Turing’, Time, 153(12)
(29 March 1999).