Results 1 
8 of
8
Computations via experiments with kinematic systems
, 2004
"... Consider the idea of computing functions using experiments with kinematic systems. We prove that for any set A of natural numbers there exists a 2dimensional kinematic system BA with a single particle P whose observable behaviour decides n ∈ A for all n ∈ N. The system is a bagatelle and can be des ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Consider the idea of computing functions using experiments with kinematic systems. We prove that for any set A of natural numbers there exists a 2dimensional kinematic system BA with a single particle P whose observable behaviour decides n ∈ A for all n ∈ N. The system is a bagatelle and can be designed to operate under (a) Newtonian mechanics or (b) Relativistic mechanics. The theorem proves that valid models of mechanical systems can compute all possible functions on discrete data. The proofs show how any information (coded by some A) can be embedded in the structure of a simple kinematic system and retrieved by simple observations of its behaviour. We reflect on this undesirable situation and argue that mechanics must be extended to include a formal theory for performing experiments, which includes the construction of systems. We conjecture that in such an extended mechanics the functions computed by experiments are precisely those computed by algorithms. We set these theorems and ideas in the context of the literature on the general problem “Is physical behaviour computable? ” and state some open problems.
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
Hierarchical Reconstructions of Cardiac Tissue
, 1998
"... We consider the general problem of comparing and integrating computational models of cardiac tissue at di#erent levels of physiological detail. We use a general theory of synchronous concurrent algorithms to model spatially extended biological systems, and expand the theory to create hierarchical mo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider the general problem of comparing and integrating computational models of cardiac tissue at di#erent levels of physiological detail. We use a general theory of synchronous concurrent algorithms to model spatially extended biological systems, and expand the theory to create hierarchical models by relating observable behaviour at di#erent levels. The general concepts and methods are illustrated by a detailed study of electrical behaviour in cardiac tissue, in which models based on coupled systems of ordinary di#erential equations, partial di#erential equations and cellular automata are compared and combined. 1 1
Streams, Stream Transformers and Domain Representations
 Prospects for Hardware Foundations, Lecture Notes in Computer Science
, 1998
"... We present a general theory for the computation of stream transformers of the form F: (R B) (T A), where time T and R, and data A and B, are discrete or continuous. We show how methods for representing topological algebras by algebraic domains can be applied to transformations of continuous ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present a general theory for the computation of stream transformers of the form F: (R B) (T A), where time T and R, and data A and B, are discrete or continuous. We show how methods for representing topological algebras by algebraic domains can be applied to transformations of continuous streams. A stream transformer is continuous in the compactopen topology on continuous streams if and only if it has a continuous lifting to a standard algebraic domain representation of such streams. We also examine the important problem of representing discontinuous streams, such as signals T A, where time T is continuous and data A is discrete.
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms
 Prospects for Hardware Foundations, Lecture Notes in Computer Science
, 1998
"... . First, we study the general idea of a spatially extended system (SES) and argue that many mathematical models of systems in computing and natural science are examples of SESs. We examine the computability and the equational definability of SESs and show that, in the discrete case, there is a n ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. First, we study the general idea of a spatially extended system (SES) and argue that many mathematical models of systems in computing and natural science are examples of SESs. We examine the computability and the equational definability of SESs and show that, in the discrete case, there is a natural sense in which an SES is computable if, and only if, it is definable by equations. We look at a simple idea of hierarchical structure for SESs and, using respacings and retimings, we define how one SES abstracts, approximates, or is implemented by another SES. Secondly, we study a special kind of SES called a synchronous concurrent algorithm (SCA). We define the simplest kind of SCA with a global clock and unit delay which are computable and equationally definable by primitive recursive equations over time. We focus on two examples of SCAs: a systolic array for convolution and a nonlinear model of cardiac tissue. We investigate the hierarchical structure of SCAs by applyin...
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 ..."