Towards a stable definition of program-size complexity - Archive ouverte en Histoire etPhilosophie des Sciences et des Techniques Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Towards a stable definition of program-size complexity

Résumé

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.

Mots clés

Fichier non déposé

Dates et versions

halshs-00792294 , version 1 (21-02-2013)

Identifiants

  • HAL Id : halshs-00792294 , version 1

Citer

Hector Zenil. Towards a stable definition of program-size complexity. ECCO Seminar Series, Nov 2009, Bruxelles, Belgium. ⟨halshs-00792294⟩
105 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More