SAD computers and two versions of the Church–Turing thesis

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/bjps/axp038
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,567
Through your library
References found in this work BETA
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Hypercomputation and the Physical Church-Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Deciding Arithmetic Using SAD Computers.Mark Hogarth - 2004 - British Journal for the Philosophy of Science 55 (4):681-691.

View all 14 references / Add more references

Citations of this work BETA
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733 - 769.
The Physical Church-Turing Thesis: Modest or Bold?G. Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
A Note on the Physical Possibility of Transfinite Computation.W. Aitken & J. A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.

Add more citations

Similar books and articles
Deciding Arithmetic Using SAD Computers.Mark Hogarth - 2004 - British Journal for the Philosophy of Science 55 (4):681-691.
Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Hypercomputation and the Physical Church-Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Added to PP index
2009-11-21

Total downloads
121 ( #41,130 of 2,180,841 )

Recent downloads (6 months)
1 ( #299,822 of 2,180,841 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums