Non-Turing Computers and Non-Turing Computability
Hogarth (Mark)
Source: PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association, Vol. 1994, Volume One: Contributed Papers (1994), pp. 126-138
Paper - Abstract

Paper StatisticsBooks / Papers Citing this PaperColour-ConventionsDisclaimer

Concluding Dialogue

  1. Frank who works on the theory of computability by means of Turing machines, reckons these new computers are not worth the candle. Isabel disagrees.
  2. Frank: I like the idea of these non-Turing computers, but frankly I can't see them catching on. They're just too, well, fantastic.
  3. Isabel: Surely a Turing machine is fantastic. At least, an infinitely massive device capable of computing to eternity sounds pretty fantastic to me.
  4. Frank: Well that's one way of putting it. I prefer to think of a Turing machine as just the natural extension of an everyday computer.
  5. Isabel: In a way it is. And that's why the hardware of these new computers is chosen to be essentially nothing but Turing machines. A simple SAD1 computer, for example, is just a Turing machine to the past of a point. Or in more picturesque terms, it's a naked Turing machine.
  6. Frank: Yes, O.K., when I said the non-Turing computers are fantastic I didn't mean the hardware so much as the spacetime supporting the hardware. Of course I believe in Turing machines; that's my job! No, my unease stems from the wild spacetimes you employ.

Text Colour Conventions (see disclaimer)

  1. Blue: Text by me; © Theo Todman, 2019
  2. Mauve: Text by correspondent(s) or other author(s); © the author(s)

© Theo Todman, June 2007 - Dec 2019. Please address any comments on this page to File output:
Website Maintenance Dashboard
Return to Top of this Page Return to Theo Todman's Philosophy Page Return to Theo Todman's Home Page