Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

La machine α : modèle générique pour les algorithmes naturels

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download
Contributor : Ivan Lavallée <>
Submitted on : Thursday, April 18, 2013 - 11:32:26 PM
Last modification on : Wednesday, October 14, 2020 - 3:44:17 AM
Long-term archiving on: : Monday, April 3, 2017 - 11:22:38 PM


Files produced by the author(s)


  • HAL Id : hal-00814812, version 2
  • ARXIV : 1304.5604


Marc Bui, Michel Lamure, Ivan Lavallee. La machine α : modèle générique pour les algorithmes naturels. 2013. ⟨hal-00814812v2⟩



Record views


Files downloads