Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published December 13, 2016 | Version v1
Journal article Open

Models, networks and algorithmic complexity

Creators

  • 1. Starlab SL

Description

I aim to show that models, classification or generating functions, invariances and datasets are algorithmically equivalent concepts once properly defined, and provide some concrete examples of them. I then show that a) neural networks (NNs) of different kinds can be seen to implement models, b) that perturbations of inputs and nodes in NNs trained to optimally implement simple models propagate strongly, c) that there is a framework in which recurrent, deep and shallow networks can be seen to fall into a descriptive power hierarchy in agreement with notions from the theory of recursive functions. The motivation for these definitions and following analysis lies in the context of cognitive neuroscience, and in particular in [17], where the concept of model is used extensively, as is the concept of algorithmic complexity.

Files

Ruffini2016.pdf

Files (955.7 kB)

Name Size Download all
md5:9ded0dc5eca82357b0a1b8b053bd311e
955.7 kB Preview Download

Additional details

Funding

LUMINOUS – Studying, Measuring and Altering Consciousness through information theory in the electrical brain 686764
European Commission