Results 1  10
of
22
Iteration, Inequalities, and Differentiability in Analog Computers
, 1999
"... Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPACcomputable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such t ..."
Abstract

Cited by 29 (15 self)
 Add to MetaCart
Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPACcomputable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such that F (x; t) = f t (x) for nonnegative integers t. We show that G is not closed under iteration, but a simple extension of it is. In particular, if we relax the definition of the GPAC slightly to include unique solutions to boundary value problems, or equivalently if we allow functions x k (x) that sense inequalities in a dierentiable way, the resulting class, which we call G + k , is closed under iteration. Furthermore, G + k includes all primitive recursive functions, and has the additional closure property that if T (x) is in G+k , then any function of x computable by a Turing machine in T (x) time is also.
A theory of complexity for continuous time systems
 Journal of Complexity
, 2002
"... We present a model of computation with ordinary differential equations (ODEs) which converge to attractors that are interpreted as the output of a computation. We introduce a measure of complexity for exponentially convergent ODEs, enabling an algorithmic analysis of continuous time flows and their ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
We present a model of computation with ordinary differential equations (ODEs) which converge to attractors that are interpreted as the output of a computation. We introduce a measure of complexity for exponentially convergent ODEs, enabling an algorithmic analysis of continuous time flows and their comparison with discrete algorithms. We define polynomial and logarithmic continuous time complexity classes and show that an ODE which solves the maximum network flow problem has polynomial time complexity. We also analyze a simple flow that solves the Maximum problem in logarithmic time. We conjecture that a subclass of the continuous P is equivalent to the classical P. 2001 Elsevier Science (USA) Key Words: theory of analog computation; dynamical systems.
Elementarily computable functions over the real numbers and Rsubrecursive functions
 THEORETICAL COMPUTER SCIENCE
, 2005
"... We present an analog and machineindependent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we prove that they correspond to the smallest class of functions that contains some basic functions, and closed by composition, linea ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We present an analog and machineindependent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we prove that they correspond to the smallest class of functions that contains some basic functions, and closed by composition, linear integration, and a simple limit schema. We generalize this result to all higher levels of the Grzegorczyk Hierarchy. This paper improves several previous partial characterizations and has a dual interest: • Concerning recursive analysis, our results provide machineindependent characterizations of natural classes of computable functions over the real numbers, allowing to define these classes without usual considerations on higherorder (type 2) Turing machines. • Concerning analog models, our results provide a characterization of the power of a natural class of analog models over the real numbers and provide new insights for understanding the relations between several analog computational models.
A survey on continuous time computations
 New Computational Paradigms
"... Abstract. We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing resu ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Abstract. We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature. 1
Upper and Lower Bounds on ContinuousTime Computation
"... We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive function ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuous time. We show that several classical computation classes have natural analog counterparts, including the primitive recursive functions, the elementary functions, the levels of the Grzegorczyk hierarchy, and the arithmetical and analytical hierarchies.
Some bounds on the computational power of Piecewise Constant Derivative systems.
 In Proceeding of ICALP'97
, 1997
"... We study the computational power of Piecewise Constant Derivative (PCD) systems. PCD systems are dynamical systems defined by a piecewise constant differential equation and can be considered as computational machines working on a continuous space with a continuous time. We show that the computation ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We study the computational power of Piecewise Constant Derivative (PCD) systems. PCD systems are dynamical systems defined by a piecewise constant differential equation and can be considered as computational machines working on a continuous space with a continuous time. We show that the computation time of these machines can be measured either as a discrete value, called discrete time, or as a continuous value, called continuous time. We relate the two notions of time for general PCD systems. We prove that general PCD systems are equivalent to Turing machines and linear machines in finite discrete time. We prove that the languages recognized by purely rational PCD systems in dimension d in finite continuous time are precisely the languages of the d \Gamma 2 th level of the arithmetical hierarchy. Hence the reachability problem of purely rational PCD systems of dimension d in finite continuous time is \Sigma d\Gamma2 complete. 1 Introduction There has been recently an increasing in...
An analog characterization of the subrecursive functions
 PROC. 4TH CONFERENCE ON REAL NUMBERS AND COMPUTERS
, 2000
"... We study a restricted version of Shannon’s General Purpose Analog Computer in which we only allow the machine to solve linear differential equations. This corresponds to only allowing local feedback in the machine’s variables. We show that if this computer is allowed to sense inequalities in a dif ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We study a restricted version of Shannon’s General Purpose Analog Computer in which we only allow the machine to solve linear differential equations. This corresponds to only allowing local feedback in the machine’s variables. We show that if this computer is allowed to sense inequalities in a differentiable way, then it can compute exactly the elementary functions. Furthermore, we show that if the machine has access to an oracle which computes a function f(x) with a suitable growth as x goes to infinity, then it can compute functions on any given level of the Grzegorczyk hierarchy. More precisely, we show that the model contains exactly the nth level of the Grzegorczyk hierarchy if it is allowed to solve n − 3 nonlinear differential equations of a certain kind. Therefore, we claim that there is a close connection between analog complexity classes, and the dynamical systems that compute them, and classical sets of subrecursive functions.
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
 Proceedings of the Fourth International Conference of Computability and Complexity in Analysis
, 2007
"... Consider the initialvalue problem with computable parameters � dx = p(t, x) dt x(t0) = x0, where p: R n+1 → R n is a vector of polynomials and (t0, x0) ∈ R n+1. We show that the problem of determining whether the maximal interval of definition of this initialvalue problem is bounded or not is in ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Consider the initialvalue problem with computable parameters � dx = p(t, x) dt x(t0) = x0, where p: R n+1 → R n is a vector of polynomials and (t0, x0) ∈ R n+1. We show that the problem of determining whether the maximal interval of definition of this initialvalue problem is bounded or not is in general undecidable. 1
How much can analog and hybrid systems be proved (super)Turing
 Applied Mathematics and Computation
, 2006
"... Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing Machines. In a contrapositive way, they say that any model with superTuring power must have something unreasonable. Our aim is to discuss how much theoretical computer science can ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing Machines. In a contrapositive way, they say that any model with superTuring power must have something unreasonable. Our aim is to discuss how much theoretical computer science can quantify this, by considering several classes of continuous time dynamical systems, and by studying how much they can be proved Turing or superTuring. 1
Iteration, Inequalities, and Dierentiability in Analog Computers
"... . Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPACcomputable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
. Shannon's General Purpose Analog Computer (GPAC) is an elegant model of analog computation in continuous time. In this paper, we consider whether the set G of GPACcomputable functions is closed under iteration, that is, whether for any function f(x) 2 G there is a function F (x; t) 2 G such that F (x; t) = f t (x) for nonnegative integers t. We show that G is not closed under iteration, but a simple extension of it is. In particular, if we relax the denition of the GPAC slightly to include unique solutions to boundary value problems, or equivalently if we allow functions x k (x) that sense inequalities in a dierentiable way, the resulting class, which we call G + k , is closed under iteration. Furthermore, G + k includes all primitive recursive functions, and has the additional closure property that if T (x) is in G+k , then any function of x computable by a Turing machine in T (x) time is also. Key words: Analog computation, recursion theory, iteration, die...