Graduate studies at Western
Minds and Machines 19 (3):391-405 (2009)
|Abstract||Hypercomputation—the hypothesis that Turing-incomputable objects can be computed through infinitary means—is ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are likewise irrelevant, since diagonalization can cover any amount of value assignments. This should not be construed as a restriction of computing power: Turing’s uncomputability is not a ‘barrier’ to be broken, but simply an effect of the expressive power of consistent programming systems.|
|Keywords||Hypercomputation Turing barrier Halting problem Uncomputability|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
B. Jack Copeland & Oron Shagrir (2011). Do Accelerating Turing Machines Compute the Uncomputable? Minds and Machines 21 (2):221-239.
B. Jack Copeland & Diane Proudfoot (2000). What Turing Did After He Invented the Universal Turing Machine. Journal of Logic, Language and Information 9 (4):491-509.
Philip D. Welch (2004). On the Possibility, or Otherwise, of Hypercomputation. British Journal for the Philosophy of Science 55 (4):739-746.
Mike Stannett (2003). Computation and Hypercomputation. Minds and Machines 13 (1):115-153.
Paolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.
Toby Ord & Tien D. Kieu (2005). The Diagonal Method and Hypercomputation. British Journal for the Philosophy of Science 56 (1):147-156.
Tien D. Kieu (2002). Quantum Hypercomputation. Minds and Machines 12 (4):541-561.
Added to index2009-10-17
Total downloads33 ( #41,973 of 739,304 )
Recent downloads (6 months)1 ( #61,243 of 739,304 )
How can I increase my downloads?