SAD computers and two versions of the Church–Turing thesis

British Journal for the Philosophy of Science 60 (4):765-792 (2009)
  Copy   BIBTEX

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

Author's Profile

Tim Button
University College London

Analytics

Added to PP
2009-11-21

Downloads
426 (#37,542)

6 months
131 (#23,593)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?