Unknown

Dataset Information

0

An attractor-based complexity measurement for Boolean recurrent neural networks.


ABSTRACT: We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of ?-automata, and then translating the most refined classification of ?-automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits.

SUBMITTER: Cabessa J 

PROVIDER: S-EPMC3984152 | biostudies-literature | 2014

REPOSITORIES: biostudies-literature

altmetric image

Publications

An attractor-based complexity measurement for Boolean recurrent neural networks.

Cabessa Jérémie J   Villa Alessandro E P AE  

PloS one 20140411 4


We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of ω-automata, and then translating the most refined classification of ω-automata to the Boolean neural network context. As a re  ...[more]

Similar Datasets

| S-EPMC9092939 | biostudies-literature
| S-EPMC8412329 | biostudies-literature
| S-EPMC7105894 | biostudies-literature
| S-EPMC7416638 | biostudies-literature
| S-EPMC7498056 | biostudies-literature
| S-EPMC3598861 | biostudies-literature
| S-EPMC4508578 | biostudies-literature
| S-EPMC7736109 | biostudies-literature
| S-EPMC7278228 | biostudies-literature
| S-EPMC8157066 | biostudies-literature