UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

SAD Computers and Two Versions of the Church–Turing Thesis

Button, T; (2009) SAD Computers and Two Versions of the Church–Turing Thesis. The British Journal for the Philosophy of Science , 60 (4) pp. 765-792. 10.1093/bjps/axp038. Green open access

[thumbnail of Button_(2009)SCCTWebArchive.pdf]
Preview
Text
Button_(2009)SCCTWebArchive.pdf - Accepted Version

Download (238kB) | Preview

Abstract

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version of the Church–Turing Thesis is unaffected by SAD computation.

Type: Article
Title: SAD Computers and Two Versions of the Church–Turing Thesis
Open access status: An open access version is available from UCL Discovery
DOI: 10.1093/bjps/axp038
Publisher version: http://dx.doi.org/10.1093/bjps/axp038
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL SLASH
UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities
UCL > Provost and Vice Provost Offices > UCL SLASH > Faculty of Arts and Humanities > Dept of Philosophy
URI: https://discovery.ucl.ac.uk/id/eprint/10091263
Downloads since deposit
33Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item