Towards a stable definition of program-size complexity

Abstract : We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. To this end statistical comparisons are undertaken of the frequency distributions of data from physical sources--repositories of information such as images, data stored in a hard drive, computer programs and DNA sequences--and the output frequency distributions generated by purely algorithmic means--by running abstract computing devices such as Turing machines, cellular automata and Post Tag systems. Statistical correlations were found and their significance measured.
Type de document :
Communication dans un congrès
ECCO Seminar Series, Nov 2009, Bruxelles, Belgium
Liste complète des métadonnées
Contributeur : Hector Zenil <>
Soumis le : jeudi 21 février 2013 - 14:02:25
Dernière modification le : mardi 24 avril 2018 - 17:20:10


  • HAL Id : halshs-00792294, version 1


Hector Zenil. Towards a stable definition of program-size complexity. ECCO Seminar Series, Nov 2009, Bruxelles, Belgium. 〈halshs-00792294〉



Consultations de la notice