Image de couverture de livre

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bournez, Olivier
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Machine Learning Logic in Computer Science Neural and Evolutionary Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
par: Blanc, Manon, et autres
Publié: (2023)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
par: Bournez, Olivier, et autres
Publié: (2026)

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
par: Bertschinger, Daniel, et autres
Publié: (2022)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
par: Hertrich, Christoph, et autres
Publié: (2021)

Parameterized Hardness of Zonotope Containment and Neural Network Verification
par: Froese, Vincent, et autres
Publié: (2025)

Position: Scaling LLM Agents Requires Asymptotic Analysis with LLM Primitives
par: Meyerson, Elliot, et autres
Publié: (2025)

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
par: Hertrich, Christoph, et autres
Publié: (2020)

PARWiS: Winner determination under shoestring budgets using active pairwise comparisons
par: Bhandari, Shailendra
Publié: (2026)

Measuring robustness of dynamical systems. Relating time and space to length and precision
par: Blanc, Manon, et autres
Publié: (2023)

Training Neural Networks is NP-Hard in Fixed Dimension
par: Froese, Vincent, et autres
Publié: (2023)

Nearest Neighbor Representations of Neural Circuits
par: Kilic, Kordag Mehmet, et autres
Publié: (2024)

Attractor FCM
par: Kafantaris, Alexis
Publié: (2026)

Machine Learning as Iterated Belief Change a la Darwiche and Pearl
par: Aravanis, Theofanis
Publié: (2025)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
par: Stargalla, Moritz, et autres
Publié: (2025)

Learning Conjecturing from Scratch
par: Gauthier, Thibault, et autres
Publié: (2025)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
par: Bournez, Olivier, et autres
Publié: (2024)

Set Descriptive Complexity of Solvable Functions
par: Gozzi, Riccardo, et autres
Publié: (2024)

Compressing ACAS-Xu Lookup Tables with Binary Decision Diagrams
par: Boniol, Martin, et autres
Publié: (2026)

Learning Guided Automated Reasoning: A Brief Survey
par: Blaauwbroek, Lasse, et autres
Publié: (2024)

Proof of Thought : Neurosymbolic Program Synthesis allows Robust and Interpretable Reasoning
par: Ganguly, Debargha, et autres
Publié: (2024)

Nearest Neighbor Representations of Neurons
par: Kilic, Kordag Mehmet, et autres
Publié: (2024)

On the Expressivity of Recurrent Neural Cascades with Identity
par: Knorozova, Nadezda Alexandrovna, et autres
Publié: (2024)

Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks
par: Vanherreweghe, Mathew, et autres
Publié: (2025)

Closing the gap: Optimizing Guidance and Control Networks through Neural ODEs
par: Origer, Sebastien, et autres
Publié: (2024)

The Descriptive Complexity of Graph Neural Networks
par: Grohe, Martin
Publié: (2023)

Feedback Favors the Generalization of Neural ODEs
par: Jia, Jindou, et autres
Publié: (2024)

Prove Symbolic Regression is NP-hard by Symbol Graph
par: Song, Jinglu, et autres
Publié: (2024)

Simulating Evolvability as a Learning Algorithm: Empirical Investigations on Distribution Sensitivity, Robustness, and Constraint Tradeoffs
par: Fidalgo, Nicholas, et autres
Publié: (2025)

Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes
par: Kergaßner, Matthias, et autres
Publié: (2024)

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
par: Alsmann, Eric, et autres
Publié: (2026)

Verifying Quantized Graph Neural Networks is PSPACE-complete
par: Sälzer, Marco, et autres
Publié: (2025)

Exploiting Chaotic Dynamics as Deep Neural Networks
par: Liu, Shuhong, et autres
Publié: (2024)

Optimizing Performance of Feedforward and Convolutional Neural Networks through Dynamic Activation Functions
par: Rane, Chinmay, et autres
Publié: (2023)

From Minimal Existence to Human Definition: The CES-IMU-HSG Theoretical Framework
par: Itoh, Kei
Publié: (2025)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
par: Kratsios, Anastasis, et autres
Publié: (2025)

An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem
par: Yang, Yang
Publié: (2024)

Bio-Inspired Adaptive Neurons for Dynamic Weighting in Artificial Neural Networks
par: Islam, Ashhadul, et autres
Publié: (2024)

SymDQN: Symbolic Knowledge and Reasoning in Neural Network-based Reinforcement Learning
par: Amador, Ivo, et autres
Publié: (2025)

HubRouter: A Pluggable Sub-Quadratic Routing Primitive for Hybrid Sequence Models
par: Basu, Abhinaba
Publié: (2026)

Provably Explaining Neural Additive Models
par: Bassan, Shahaf, et autres
Publié: (2026)