Constraints on hypercomputation

Authors:
Greg Michaelson;Paul Cockshott
Affiliations:
Heriot Watt University;University of Glasgow
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 5
Cited 2

Models of massive parallelism: analysis of cellular automata and neural networks

Models of massive parallelism: analysis of cellular automata and neural networks
Pict: a programming language based on the Pi-Calculus

Proof, language, and interaction
Hypercomputation

Minds and Machines
Engines of Logic: Mathematicians and the Origin of the Computer

Engines of Logic: Mathematicians and the Origin of the Computer
Turing machines, transition systems, and interaction

Information and Computation

Physical constraints on hypercomputation

Theoretical Computer Science
A hardware relaxation paradigm for solving NP-hard problems

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wegner and Eberbach [16] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called superTuring models. In this paper we contest their claims for interaction machines and the π-calculus.