Parallel Computation Is ESS

There are enormous amount of examples of Computation in nature, exemplified across multiple species in biology. One crucial aim for these computations across all life forms their ability to learn and thereby increase the chance of their survival. In the current paper a formal definition of autonomou...

Full description

Saved in:
Bibliographic Details
Main Authors Mondal, Nabarun, Ghosh, Partha P
Format Journal Article
LanguageEnglish
Published 31.03.2013
Subjects
Computer Science - Artificial Intelligence
Computer Science - Computer Science and Game Theory
Computer Science - Learning
Online AccessGet full text

Cover

More Information
Summary:There are enormous amount of examples of Computation in nature, exemplified across multiple species in biology. One crucial aim for these computations across all life forms their ability to learn and thereby increase the chance of their survival. In the current paper a formal definition of autonomous learning is proposed. From that definition we establish a Turing Machine model for learning, where rule tables can be added or deleted, but can not be modified. Sequential and parallel implementations of this model are discussed. It is found that for general purpose learning based on this model, the implementations capable of parallel execution would be evolutionarily stable. This is proposed to be of the reasons why in Nature parallelism in computation is found in abundance.
DOI:10.48550/arxiv.1304.0160