Minds and Machines 24 (3):275-305 (2014)

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally. This gives impetus to propose and justify a more plausible starting point for an extension to the classical paradigm that is physically possible, at least in principle. Instead of attempting to rely on infinities such as idealized limits of infinite time or numerical precision, or some other physically unattainable source, one should focus on extending the classical paradigm to better encapsulate modern computational problems that are not well-expressed/modeled by the closed-system paradigm of the Turing machine. I present the first steps toward this goal by considering contemporary computational problems dealing with intractability and issues surrounding cyber-physical systems, and argue that a reasonable extension to the classical paradigm should focus on these issues in order to be practically viable
Keywords Hypercomputation  Physical computation  Gandy  Thesis M  Church–Turing thesis  Human computation  Machine computation  Quantum computing  DNA computing  Natural computing
Categories (categorize this paper)
DOI 10.1007/s11023-013-9317-3
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,114
Through your library

References found in this work BETA

Introduction to Metamathematics.Stephen Cole Kleene - 1952 - Princeton, NJ, USA: North Holland.
On Computable Numbers, with an Application to the N Tscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
The Logic of Reliable Inquiry.Kevin T. Kelly - 1996 - Oxford, England: Oxford University Press USA.
Systems of Logic Based on Ordinals.Alan Mathison Turing - 1939 - London: Printed by C.F. Hodgson & Son.

View all 65 references / Add more references

Citations of this work BETA

Programming Infinite Machines.Anton A. Kutsenko - 2022 - Erkenntnis 87 (1):181-189.

Add more citations

Similar books and articles

Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Computation and Hypercomputation.Mike Stannett - 2003 - Minds and Machines 13 (1):115-153.
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Neural and Super-Turing Computing.Hava T. Siegelmann - 2003 - Minds and Machines 13 (1):103-114.
Semantics of Information as Interactive Computation.Gordana Dodig-Crnkovic - 2008 - Proceedings of the Fifth International Workshop on Philosophy and Informatics 2008.
Hypercomputation: Computing More Than the Turing Machine.Toby Ord - 2002 - Dissertation, University of Melbourne


Added to PP index

Total views
82 ( #140,109 of 2,499,247 )

Recent downloads (6 months)
5 ( #139,210 of 2,499,247 )

How can I increase my downloads?


My notes