A characterization of functions over the integers computable in polynomial time using discrete differential equations

by   Olivier Bournez, et al.

This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and algorithm design. We present the general theory of discrete ODEs for computation theory, we illustrate this with various examples of algorithms, and we provide several implicit characterizations of complexity and computability classes. The proposed framework presents an original point of view on complexity and computation classes. It unifies several constructions that have been proposed for characterizing these classes including classical approaches in implicit complexity using restricted recursion schemes, as well as recent characterizations of computability and complexity by classes of continuous ordinary differential equations. It also helps understanding the relationships between analog computations and classical discrete models of computation theory. At a more technical point of view, this paper points out the fundamental role of linear (discrete) ODEs and classical ODE tools such as changes of variables to capture computability and complexity measures, or as a tool for programming many algorithms.


page 1

page 2

page 3

page 4


Recursion schemes, discrete differential equations and characterization of polynomial time computation

This papers studies the expressive and computational power of discrete O...

Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

There is no single canonical polynomial-time version of the Axiom of Cho...

Axiomatic Tools versus Constructive approach to Unconventional Algorithms

In this paper, we analyze axiomatic issues of unconventional computation...

Approximability in the GPAC

Most of the physical processes arising in nature are modeled by either o...

On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

Lifted inference allows to perform inference in polynomial time w.r.t. d...

A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

In a recent article, the class of functions from the integers to the int...

Polynomial time computable functions over the reals characterized using discrete ordinary differential equations

The class of functions from the integers to the integers computable in p...

Please sign up or login with your details

Forgot password? Click here to reset