Cover Image

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blanc, Manon, Bournez, Olivier
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity Logic in Computer Science Dynamical Systems Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Measuring robustness of dynamical systems. Relating time and space to length and precision
by: Blanc, Manon, et al.
Published: (2023)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
by: Bournez, Olivier, et al.
Published: (2024)

Set Descriptive Complexity of Solvable Functions
by: Gozzi, Riccardo, et al.
Published: (2024)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
by: Bournez, Olivier
Published: (2026)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
by: Bournez, Olivier, et al.
Published: (2026)

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
by: Callard, Antonin, et al.
Published: (2024)

Fagin's Theorem for Semiring Turing Machines
by: Badia, Guillermo, et al.
Published: (2025)

Solving promise equations over monoids and groups
by: Larrauri, Alberto, et al.
Published: (2024)

On Effective Banach-Mazur Games and an application to the Poincaré Recurrence Theorem for Category
by: Koul, Prajval, et al.
Published: (2025)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Zeta Functions and the (Linear) Logic of Markov Processes
by: Seiller, Thomas
Published: (2020)

Toward higher-order infinite time Turing machines: simulational $Γ$-machines
by: Bournez, Olivier, et al.
Published: (2025)

Extending CDCL to disjunctions of parity equations
by: Beame, Paul, et al.
Published: (2026)

Equivariant Borel liftings in complex analysis and PDE
by: Slutsky, Konstantin, et al.
Published: (2025)

Separating Orbits by Entire Functions
by: Duckworth, Billy, et al.
Published: (2026)

Hardness of monadic second-order formulae over succinct graphs
by: Gamard, Guilhem, et al.
Published: (2023)

Snakes can be fooled into thinking they live in a tree
by: Bartholdi, Laurent, et al.
Published: (2024)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

Memoryless concretization relation
by: Calbert, Julien, et al.
Published: (2024)

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

The subTuring degrees
by: Kihara, Takayuki, et al.
Published: (2024)

Local consistency as a reduction between constraint satisfaction problems
by: Dalmau, Victor, et al.
Published: (2023)

A characterization of efficiently compilable constraint languages
by: Berkholz, Christoph, et al.
Published: (2023)