On the Possibilities of Hypercomputing Supertasks

  title={On the Possibilities of Hypercomputing Supertasks},
  author={Vincent C. M{\"u}ller},
  journal={Minds and Machines},
  • V. C. Müller
  • Published 1 February 2011
  • Computer Science
  • Minds and Machines
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… 

On More or Less Appropriate Notions of 'Computation'

This paper presents some arguments about which notions of “computation” may be considered “reasonably acceptable” for the authors' own historic era, and emphasizes that every science-philosophical notion has its own long-term historical semantics which cannot be fixed once and forever.

Abstract platforms of computation

A framework is presented under which all dynamical systems can be considered as instances of the class of abstract computational platforms and it is asserted that a platform’s computational expressiveness is directly related to the freedom with which constraints can be placed.

Zeno-machines and the metaphysics of time

This paper aims to explore the nature of Zeno-machines by examining their conceptual coherence, from the perspective of contemporary theories on the passage of time. More specifically, it will

What Is Morphological Computation? On How the Body Contributes to Cognition and Control

The question for robot design and cognitive science is not whether computation is offloaded to the body, but to what extent the body facilitates cognition and control—how it contributes to the overall orchestration of intelligent behavior.



On the Possibility, or Otherwise, of Hypercomputation

  • P. Welch
  • Mathematics, Philosophy
    The British Journal for the Philosophy of Science
  • 2004
We claim that a recent article of P. Cotogno ([2003]) in this journal is based on an incorrect argument concerning the non-computability of diagonal functions. The point is that whilst diagonal

A Brief Critique of Pure Hypercomputation

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

Zeno machines and hypercomputation

The Diagonal Method and Hypercomputation

  • Toby OrdT. Kieu
  • Mathematics
    The British Journal for the Philosophy of Science
  • 2005
It is demonstrated why a contradiction only occurs if a type of machine can compute its own diagonal function, and why such a situation does not occur for the methods of hypercomputation under attack, andwhy it is unlikely to occur for any other serious methods.

The Broad Conception of Computation

A myth has arisen concerning Turing's article of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine; this supposed principle is sometimes incorrectly termed the Church-Turing thesis.

Hypercomputation and the Physical Church‐Turing Thesis

  • Paolo Cotogno
  • Philosophy, Computer Science
    The British Journal for the Philosophy of Science
  • 2003
A version of the Church‐Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical,

Physical Hypercomputation and the Church–Turing Thesis

It is argued that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's thesis.

What Turing Did after He Invented the Universal Turing Machine

Alan Turing's contribution to Artificial Intelligence, connectionism, hypercomputation, and Artificial Life is outlined, and his pioneering role in the development of electronic stored-program digital computers is described.

Super-tasks, accelerating Turing machines and uncomputability