On the Possibilities of Hypercomputing Supertasks

Minds and Machines 21 (1):83-96 (2011)
Download Edit this record How to cite View on PhilPapers
Abstract
This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified such that they do not have output states, or they are specified such that they do have output states, but involve contradiction. Repairs though non-effective methods or special rules for semi-decidable problems are sought, but not found. The paper concludes that hypercomputing supertasks are impossible in the actual world and thus no reason for rejection of the Church-Turing thesis in its traditional interpretation.
PhilPapers/Archive ID
MLLOTP
Revision history
First archival date: 2011-01-03
Latest version: 2 (2015-11-02)
View upload history
References found in this work BETA
Computability and Logic.Boolos, George; Burgess, John; P., Richard & Jeffrey, C.

View all 45 references / Add more references

Citations of this work BETA

Add more citations

Added to PP index
2011-01-03

Total views
412 ( #7,535 of 42,235 )

Recent downloads (6 months)
75 ( #7,372 of 42,235 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.