SAD computers and two versions of the Church–Turing Thesis
Keyword(s):
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 barriers 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.Published in British Journal for the Philosophy of Science 60.4: 765–92.
Keyword(s):
2021 ◽
Vol 1730
(1)
◽
pp. 012037
Keyword(s):
1997 ◽
Vol 28
(1)
◽
pp. 3-23
◽