Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1304.5604

La machine \alpha: mod\`ele g\'en\'erique pour les algorithmes naturels

Marc Bui·Michel Lamure·Ivan Lavallee
View original source ↗Read source document ↗Export metadata ↓

Abstract

So far, following the works of A.M. Turing, the algorithms were considered as the mathematical abstraction from which we could write programs for computers whose principle was based on the theoretical concept of Turing machine. We start here from the observation that natural algorithms or rather algorithms of the nature which are massively parallel, autoadaptative and reproductible, and for which we do not know how they really work, nor why, are not easily specified by the current theoretical model of Universal Turing machine, or Universal Computer. In particular the aspects of communications, evolutionary rules (rulers), random (unpredictable) events, just like the genetic code, are taken into account only by subtleties which oblige to break the theory. We shall propose one \textit{universal model} of algorithm called machine-alpha which contains and generalizes the existing models. --- Jusqu'ici, suite aux travaux de A.M.Turing [Turing, 1936], les algorithmes ont \'et\'e vus comme l'abstraction \`a partir de laquelle on pouvait \'ecrire des programmes pour des ordinateurs dont le principe \'etait lui-m\^eme issu du concept th\'eorique de machine de Turing. Nous partons ici du constat que les algorithmes naturels ou plut\^ot les algorithmes de la nature, massivement parall\`eles, autoadaptatifs et auto reproductibles, dont on ne sait pas comment ils fonctionnent r\'eellement, ni pourquoi, ne sont pas ais\'ement sp\'ecifi\'es par le mod\`ele th\'eorique actuel de Machine de Turing Universelle, ou de Calculateur Universel ; en particulier les aspects de communications, de r\`egles \'evolutives, d' \'ev\'enements al\'eatoires, \`a l'image du code g\'en\'etique, ne sont pris en compte que par ajout d'artifices \`a la th\'eorie. Nous nous proposons ici de montrer comment aborder ces probl\`emes en repensant le mod\`ele th\'eorique. Nous proposerons un mod\`ele d'algorithme, appel\'e ici machine-\alpha qui contient et g\'en\'eralise les mod\`eles existants.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Marc Bui, Michel Lamure, Ivan Lavallee. 2013-04-20. La machine \alpha: mod\`ele g\'en\'erique pour les algorithmes naturels. https://arxiv.org/abs/1304.5604

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗