Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 429 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

La machine α: modèle générique pour les algorithmes naturels (1304.5604v1)

Published 20 Apr 2013 in cs.CC

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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.