Even Turing machines can compute uncomputable functions

Abstract

Accelerated Turing machines are Turing machines that perform tasks commonly regarded as impossible, such as computing the halting function. The existence of these notional machines has obvious implications concerning the theoretical limits of computability.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

On Alan Turing's anticipation of connectionism.Jack Copeland - 1996 - Synthese 108 (3):361-377.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Computing machines can't be intelligent (...And Turing said so).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.
Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.

Analytics

Added to PP
2009-01-28

Downloads
2 (#1,804,667)

6 months
0

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jack Copeland
University of Canterbury

Citations of this work

The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Super turing-machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.
Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references