Some non-conventional ideas about algorithmic complexity

DOI10.1016/J.CHAOS.2004.11.040MaRDI QIDQ2483647zbMATH OpenOpenAlexFDO

Authors Germano D'Abramo

Publication date 25 July 2005

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0211222

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: In this paper the author presents some non-conventional thoughts on the complexity of the Universe and the algorithmic reproducibility of the human brain, essentially sparked off by the notion of algorithmic complexity. We must warn that though they evoke suggestive scenarios, they are still quite speculative.

Recommendations

• Physics and metaphysics look at computation
• scientific article; zbMATH DE number 4063056
• Computability and emergence
• Turing: then, now and still key
• The fluidity of simplicity: philosophy, mathematics, art

Cites work

• A formal theory of inductive inference. Part I
• Information, randomness and incompleteness. Papers on algorithmic information theory
• The concepts of \(E\) infinity: an elementary introduction to the Cantorian-fractal theory of quantum physics

Cited in

(4)

• Polynomial fill-in puzzles or how to make sense of the cook-Levin theorem
• Impugning randomness, convincingly
• The fluidity of simplicity: philosophy, mathematics, art
• Impugning randomness, convincingly

This page was built for publication: Some non-conventional ideas about algorithmic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483647)