Hybrid Automata and\epsilon-Analysis on a Neural Oscillator

A Casagrande, T Dreossi, C Piazza - arXiv preprint arXiv:1208.3852, 2012 - arxiv.org
In this paper we propose a hybrid model of a neural oscillator, obtained by partially
discretizing a well-known continuous model. Our construction points out that in this case the …

On the Trade-Off Between Efficiency and Precision of Neural Abstraction

A Edwards, M Giacobbe, A Abate - International Conference on …, 2023 - Springer
Neural abstractions have been recently introduced as formal approximations of complex,
nonlinear dynamical models. They comprise a neural ODE and a certified upper bound on …

Towards an Algebraic Framework For Approximating Functions Using Neural Network Polynomials

S Rafi, JL Padgett, U Nakarmi - arXiv preprint arXiv:2402.01058, 2024 - arxiv.org
We make the case for neural network objects and extend an already existing neural network
calculus explained in detail in Chapter 2 on\cite {bigbook}. Our aim will be to show that, yes …

Chaotic neural nets, computability, and undecidability: Toward a computational dynamics

G Basti, AL Perrone - International Journal of Intelligent …, 1995 - Wiley Online Library
In this article we intend to analyze a chaotic system from the standpoint of its computation
capability. to pursue this aim, we refer to a complex chaotic dynamics that we characterize …

Spiking neurons and the induction of finite state machines

T Natschläger, W Maass - Theoretical computer science, 2002 - Elsevier
We discuss in this short survey article some current mathematical models from
neurophysiology for the computational units of biological neural systems: neurons and …

On the interpretation of recurrent neural networks as finite state machines

C Oliva, LF Lago-Fernández - … , Munich, Germany, September 17–19, 2019 …, 2019 - Springer
The behavior of simple recurrent neural networks trained on regular languages is analyzed
in terms of accuracy and interpretability. We use controlled amounts of noise and L1 …

A modular architecture for transparent computation in recurrent neural networks

GS Carmantini, P Beim Graben, M Desroches… - Neural Networks, 2017 - Elsevier
Computation is classically studied in terms of automata, formal languages and algorithms;
yet, the relation between neural dynamics and symbolic representations and operations is …

Automata computation with hodgkin-huxley based neural networks composed of synfire rings

J Cabessa, A Tchaptchet - 2018 International Joint Conference …, 2018 - ieeexplore.ieee.org
Recent results have shown that finite state automata can be simulated by recurrent neural
networks composed of synfire rings. The simulation process was shown to work correctly in …

Neural computation with spiking neural networks composed of synfire rings

J Cabessa, G Horcholle-Bossavit, B Quenet - Artificial Neural Networks …, 2017 - Springer
We show that any finite state automaton can be simulated by some neural network of
Izhikevich spiking neurons composed of interconnected synfire rings. The construction turns …

Structure of universal formulas

D Yarotsky - Advances in Neural Information Processing …, 2024 - proceedings.neurips.cc
By universal formulas we understand parameterized analytic expressions that have a fixed
complexity, but nevertheless can approximate any continuous function on a compact set …