Deciding arithmetic using SAD computers
British Journal for the Philosophy of Science 55 (4):681-691 (2004)
| Abstract | Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of computability. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
|
| Through your library | Configure |
Bernd Carsten Stahl (2004). Information, Ethics, and Computers: The Problem of Autonomous Moral Agents. Minds and Machines 14 (1):67-83.
L.�szl� Ropolyi (1999). Life-Worlds and Social Relations in Computers. AI and Society 13 (1-2):69-87.
Arthur W. Burks (1973). Logic, Computers, and Men. Proceedings and Addresses of the American Philosophical Association 46:39-57.
Bernd Carsten Stahl (2006). Responsible Computers? A Case for Ascribing Quasi-Responsibility to Computers Independent of Personhood or Agency. Ethics and Information Technology 8 (4):205-213.
Tim van Gelder (1998). Computers and Computation in Cognitive Science. In T.M. Michalewicz (ed.), Advances in Computational Life Sciences Vol.2: Humans to Proteins. Melbourne: CSIRO Publishing.
Peter Kugel (2002). Computing Machines Can't Be Intelligent (...And Turing Said So). Minds and Machines 12 (4):563-579.
James A. Anderson (2003). Arithmetic on a Parallel Computer: Perception Versus Logic. Brain and Mind 4 (2):169-188.
Tim Button (2009). Sad Computers and Two Versions of the Church–Turing Thesis. British Journal for the Philosophy of Science 60 (4):765-792.
Mark Hogarth (1994). Non-Turing Computers and Non-Turing Computability. Psa 1994:126--138.
Monthly downloads |
Added to index2009-01-28Total downloads15 ( #78,761 of 549,671 )Recent downloads (6 months)2 ( #37,450 of 549,671 )How can I increase my downloads? |

