Definability as hypercomputational effect

  title={Definability as hypercomputational effect},
  author={S. Barry Cooper},
  journal={Appl. Math. Comput.},
  • S. Cooper
  • Published 1 July 2006
  • Computer Science
  • Appl. Math. Comput.

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

Emergence as a computability-theoretic phenomenon

  • S. Cooper
  • Computer Science
    Appl. Math. Comput.
  • 2009

The Extended Turing Model as Contextual Tool

This work looks at ways in which computability-theoretic structure emerges in natural contexts, and how algorithmic structure does not just emerge mathematically from information, but how that emergent structure can model the emergence of very basic aspects of the real world.

The Computational Roots of Hyper-Causality?

  • S. Cooper
  • Computer Science
    Int. J. Unconv. Comput.
  • 2010
This work looks at ways in which computabilitytheoretic structure plays a hierarchical role in natural contexts, and how structure does not just emerge mathematically from information, but how that structure can model the emergence of very basic aspects of the real world of a non-local character.

Extending and interpreting Post's programme

  • S. Cooper
  • Computer Science
    Ann. Pure Appl. Log.
  • 2010


The paper will discuss methodological and cognitive premises of posing the question of decidability as well as the ideas that have been born since the appearance of the problem of decodability, and suggest a computer that could cross the barriers of the Turing machine.

Mathematics, Metaphysics and the Multiverse

  • S. Cooper
  • Philosophy
    Computation, Physics and Beyond
  • 2012
It is argued that this depends on us selecting mathematical models which take account of the ‘thingness' of reality, and puts the mathematics in a correspondingly rich information-theoretic context, and that the task is to restore the role of embodied computation and its hierarchically arising attributes.

Algorithmic Social Sciences Research Unit

Stephen Wolfram’s A New Kind of Science should have made a greater impact in economics at least in its theorising and computational modes than it seems to have. There are those who subscribe to

How Can Nature Help Us Compute?

Ever since Alan Turing gave us a machine model of algorithmic computation, there have been questions about how widely it is applicable (some asked by Turing himself). Although the computer on our



The Myth of Hypercomputation

Under the banner of “hypercomputation” various claims are being made for the feasibility of modes of computation that go beyond what is permitted by Turing computability. In this article it will be

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

Incomputability in Nature

To what extent is incomputability relevant to the material Universe? We look at ways in which this question might be answered, and the extent to which the theory of computability, which grew out of

Computability and Emergence

The extent to which Turing’s approach to realworld computability is still relevant today is examined, and some fundamental questions facing those with a research interest in computability theory are pointed to.

Relativistic computers and the Turing barrier

Non-Turing Computations Via Malament–Hogarth Space-Times

It is argued that there are several distinguished Church–Turing-type theses (not only one) and validity of some of these theses depend on the background physical theory the authors choose to use, and if they choose classical general relativity theory as their background theory, then certain forms of the Church-Turing thesis cease to be valid.

The Incomputable Alan Turing

This paper focuses on incomputability as a powerful theme in Turing's work and personal life, and examines its role in his evolving concept of machine intelligence.

Beyond Gödel's Theorem: Turing Nonrigidity Revisited

In [4] it was argued that incomputability in nature dictates a mathematical model (due to Turing [39]) based on mechanical processes relative to appropriate abstractions of incomputable phenomena.

The Turing machine paradigm in contemporary computing

The work of Hartmanis, Stearns, Karp, Cook and others showed that the refinement of the theory to resource-bounded computations gave the means to explain the many intuitions concerning the complexity or ‘hardness’ of algorithmic problems in a precise and rigorous framework.

Turing’s O-machines, Searle, Penrose and the brain

Analogies offered in the literature include hurricanes, the motion of the planets around the sun, and the digestion of pizza. None of these phenomena is itself computational in nature yet,