Results 1 
9 of
9
Can newtonian systems, bounded in space, time, mass and energy compute all functions
 Theoretical Computer Science
, 1980
"... In the theoretical analysis of the physical basis of computation there is a great deal of confusion and controversy (e.g., on the existence of hypercomputers). First, we present a methodology for making a theoretical analysis of computation by physical systems. We focus on the construction and anal ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
In the theoretical analysis of the physical basis of computation there is a great deal of confusion and controversy (e.g., on the existence of hypercomputers). First, we present a methodology for making a theoretical analysis of computation by physical systems. We focus on the construction and analysis of simple examples that are models of simple subtheories of physical theories. Then we illustrate the methodology, by presenting a simple example for Newtonian Kinematics, and a critique that leads to a substantial extension of the methodology. The example proves that for any set A of natural numbers there exists a 3dimensional Newtonian kinematic system MA, with an infinite family of particles Pn whose total mass is bounded, and whose observable behaviour can decide whether or not n ∈ A for all n ∈ N in constant time. In particular, the example implies that simple Newtonian kinematic systems that are bounded in space, time, mass and energy can compute all possible sets and functions on discrete data. The system is a form of marble run and is a model of a small fragment of Newtonian Kinematics. Next, we use the example to extend the methodology. The marble run shows that a formal theory for computation by physical systems needs strong conditions on the notion of experimental procedure and, specifically, on methods for the construction of equipment. We propose to extend the methodology by defining languages to express experimental procedures and the construction of equipment. We conjecture that the functions computed by experimental computation in Newtonian Kinematics are “equivalent ” to those computed by algorithms, i.e. the partial computable functions. 1
Physicallyrelativized ChurchTuring Hypotheses. Applied Mathematics and Computation 215, 4
 in the School of Mathematics at the University of Leeds, U.K. © 2012 ACM 00010782/12/03 $10.00 march 2012  vol. 55  no. 3  communications of the acm 83
"... Abstract. We turn ‘the ’ ChurchTuring Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and welldefined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), sug ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We turn ‘the ’ ChurchTuring Hypothesis from an ambiguous source of sensational speculations into a (collection of) sound and welldefined scientific problem(s): Examining recent controversies, and causes for misunderstanding, concerning the state of the ChurchTuring Hypothesis (CTH), suggests to study the CTH relative to an arbitrary but specific physical theory—rather than vaguely referring to “nature ” in general. To this end we combine (and compare) physical structuralism with (models of computation in) complexity theory. The benefit of this formal framework is illustrated by reporting on some previous, and giving one new, example result(s) of computability
Computational Power of Infinite Quantum Parallelism
 pp.2057–2071 in International Journal of Theoretical Physics vol.44:11
, 2005
"... Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of class ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of classical parallel computing. We compare this new one with other attempts towards hypercomputation by separating (1) its computing capabilities from (2) realizability issues. The first are shown to coincide with recursive enumerability; the second are considered in analogy to ‘existence’ in mathematical logic. KEY WORDS: Hypercomputation; quantum mechanics; recursion theory; infinite parallelism.
Series Preproceedings of the Workshop “Physics and Computation ” 2008
, 2008
"... In the 1940s, two different views of the brain and the computer were equally important. One was the analog technology and theory that had emerged before the war. The other was the digital technology and theory that was to become the main paradigm of computation. 1 The outcome of the contest between ..."
Abstract
 Add to MetaCart
In the 1940s, two different views of the brain and the computer were equally important. One was the analog technology and theory that had emerged before the war. The other was the digital technology and theory that was to become the main paradigm of computation. 1 The outcome of the contest between these two competing views derived from technological and epistemological arguments. While digital technology was improving dramatically, the technology of analog machines had already reached a significant level of development. In particular, digital technology offered a more effective way to control the precision of calculations. But the epistemological discussion was, at the time, equally relevant. For the supporters of the analog computer, the digital model — which can only process information transformed and coded in binary — wouldn’t be suitable to represent certain kinds of continuous variation that help determine brain functions. With analog machines, on the contrary, there would be few or no layers between natural objects and the work and structure of computation (cf. [4, 1]). The 1942–52 Macy Conferences in cybernetics helped to validate digital theory and logic as legitimate ways to think about the brain and the machine [4]. In particular, those conferences helped made McCullochPitts ’ digital model
Does Quantum Mechanics allow for Infinite Parallelism?
, 2004
"... Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that Quantum Mechanics seems to support some infinite variant of classical paral ..."
Abstract
 Add to MetaCart
Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of ‘standard ’ Quantum Computers. These approaches rely on and indicate that Quantum Mechanics seems to support some infinite variant of classical parallel computing. We compare this new one with other attempts towards hypercomputation by separating 1) its principal computing capabilities from 2) realizability issues. The first are shown to coincide with recursive enumerability; the second are considered in analogy to ‘existence ’ in mathematical logic.
Report # CSR 102005Newtonian systems, bounded in space, time, mass
"... Newtonian systems, bounded in space, time, mass and energy can compute all functions by ..."
Abstract
 Add to MetaCart
Newtonian systems, bounded in space, time, mass and energy can compute all functions by
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES
"... Newtonian mechanics and infinitely parallel computation by ..."