Results 1  10
of
14
Hypercomputation and the Physical ChurchTuring Thesis
, 2003
"... A version of the ChurchTuring Thesis states that every e#ectively realizable physical system can be defined by Turing Machines (`Thesis P'); in this formulation the Thesis appears an empirical, more than a logicomathematical, proposition. We review the main approaches to computation beyond Tu ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
A version of the ChurchTuring Thesis states that every e#ectively realizable physical system can be defined by Turing Machines (`Thesis P'); in this formulation the Thesis appears an empirical, more than a logicomathematical, proposition. We review the main approaches to computation beyond Turing definability (`hypercomputation'): supertask, nonwellfounded, analog, quantum, and retrocausal computation. These models depend on infinite computation, explicitly or implicitly, and appear physically implausible; moreover, even if infinite computation were realizable, the Halting Problem would not be a#ected. Therefore, Thesis P is not essentially di#erent from the standard ChurchTuring Thesis.
General relativistic hypercomputing and foundation of mathematics
"... Abstract. Looking at very recent developments in spacetime theory, we can wonder whether these results exhibit features of hypercomputation that traditionally seemed impossible or absurd. Namely, we describe a physical device in relativistic spacetime which can compute a nonTuring computable task, ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. Looking at very recent developments in spacetime theory, we can wonder whether these results exhibit features of hypercomputation that traditionally seemed impossible or absurd. Namely, we describe a physical device in relativistic spacetime which can compute a nonTuring computable task, e.g. which can decide the halting problem of Turing machines or decide whether ZF set theory is consistent (more precisely, can decide the theorems of ZF). Starting from this, we will discuss the impact of recent breakthrough results of relativity theory, black hole physics and cosmology to well established foundational issues of computability theory as well as to logic. We find that the unexpected, revolutionary results in the mentioned branches of science force us to reconsider the status of the physical Church Thesis and to consider it as being seriously challenged. We will outline the consequences of all this for the foundation of mathematics (e.g. to Hilbert’s programme). Observational, empirical evidence will be quoted to show that the statements above do not require any assumption of some physical universe outside of our own one: in our specific physical universe there seem to exist regions of spacetime supporting potential nonTuring computations. Additionally, new “engineering ” ideas will be outlined for solving the socalled blueshift problem of GRcomputing. Connections with related talks at the Physics and Computation meeting, e.g. those of Jerome DurandLose, Mark Hogarth and Martin Ziegler, will be indicated. 1
On the Possibilities of Hypercomputing Supertasks
 FORTHCOMING IN MINDS AND MACHINES
, 2011
"... This paper investigates the view that digital hypercomputing is a good reason for rejection or reinterpretation of the ChurchTuring thesis. After suggestion that such reinterpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses prop ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper investigates the view that digital hypercomputing is a good reason for rejection or reinterpretation of the ChurchTuring thesis. After suggestion that such reinterpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with “Zenomachines”, i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zenomachines falls into a dilemma: either they are specified such that they do not have output states, or they are specified such that they do have output states, but involve contradiction. Repairs though noneffective methods or special rules for semidecidable problems are sought, but not found. The paper concludes that hypercomputing supertasks are impossible in the actual world and thus no reason for rejection of the ChurchTuring thesis in its traditional interpretation.
ACCELERATING MACHINES
, 2006
"... This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation me ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation methods that have been presented. Finally, we expose the limitations of accelerating machines and conclude by posing some problems for further research.
New Physics and Hypercomputation
"... Abstract. Does new physics give us a chance for designing computers, at least in principle, which could compute beyond the Turing barrier? By the latter we mean computers which could compute some functions which are not Turing computable. Part of what we call “new physics ” is the surge of results i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Does new physics give us a chance for designing computers, at least in principle, which could compute beyond the Turing barrier? By the latter we mean computers which could compute some functions which are not Turing computable. Part of what we call “new physics ” is the surge of results in black hole physics in the last 15 years, which certainly changed our perspective on certain things. The two main directions in this line seem to be quantum computers and relativistic, i.e. spacetimetheorybased, ones. We will concentrate on the relativistic case. Is there a remote possibility that relativity can give some feedback to its “founding grandmother”, namely, to logic? 1 General perspective The Physical ChurchTuring Thesis, PhCT, is the conjecture that whatever physical computing device (in the broader sense) or physical thought experiment will be designed by any future civilization, it will always be simulatable by a Turing machine. The PhCT was formulated and generally accepted in the 1930’s.
Can new physics challenge “old ” computational barriers?
"... Abstract. We discuss the impact of very recent developments of spacetime theory, black hole physics, and cosmology to well established foundational issues of computability theory and logic. Namely, we describe a physical device in relativistic spacetime which can compute a nonTuring computable task ..."
Abstract
 Add to MetaCart
Abstract. We discuss the impact of very recent developments of spacetime theory, black hole physics, and cosmology to well established foundational issues of computability theory and logic. Namely, we describe a physical device in relativistic spacetime which can compute a nonTuring computable task, e.g. which can decide the halting problem of Turing machines or whether ZF set theory is consistent or not. Connections with foundation of mathematics and foundation of spacetime theory will be discussed. 1
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES
"... Newtonian mechanics and infinitely parallel computation by ..."
(Show Context)
UNIVERSITY OF PITTSBURGH FACULTY OF ARTS AND SCIENCES
, 2003
"... This dissertation was presented by ..."