© 2004 by British Society for the Philosophy of Science
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Deciding Arithmetic Using SAD Computers
Department of History and Philosophy of Science, Free School Lane, Cambridge CB2 3RH, UK, mhogarth{at}cantab.net
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
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
T. Button SAD Computers and Two Versions of the Church-Turing Thesis Brit J Philos Sci, December 1, 2009; 60(4): 765 - 792. [Abstract] [Full Text] [PDF] |
||||
![]() |
P. D. Welch The Extent of Computation in Malament-Hogarth Spacetimes Brit J Philos Sci, December 1, 2008; 59(4): 659 - 674. [Abstract] [Full Text] [PDF] |
||||
