Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
The Universal Computer: The Road from Leibniz to Turing
The Universal Computer: The Road from Leibniz to Turing
Computers Ltd.: What They Really Can't Do
Computers Ltd.: What They Really Can't Do
Philosophy and Computing: An Introduction
Philosophy and Computing: An Introduction
Minds and Machines
Minds and Machines
What Turing Did after He Invented the Universal Turing Machine
Journal of Logic, Language and Information
Minds and Machines
Computationalism: New Directions
Computationalism: New Directions
Physical Hypercomputation and the Church–Turing Thesis
Minds and Machines
Hypercomputation with quantum adiabatic processes
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Super-tasks, accelerating Turing machines and uncomputability
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Hypercomputation: philosophical issues
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Zeno machines and hypercomputation
Theoretical Computer Science
Representation in Digital Systems
Proceedings of the 2008 conference on Current Issues in Computing and Philosophy
A Brief Critique of Pure Hypercomputation
Minds and Machines
| Hi-index | 0.00 |
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.