SETI bioastro: Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox

From: LARRY KLAES (ljk4_at_msn.com)
Date: Tue Sep 27 2005 - 17:28:12 UTC

  • Next message: LARRY KLAES: "SETI bioastro: Fw: Featuring Cornell: Science Cabaret"

    Physics, abstract
    physics/0508010

    From: V. G. Gurzadyan [view email]

    Date (v1): Mon, 1 Aug 2005 20:13:14 GMT (4kb)
    Date (revised v2): Mon, 26 Sep 2005 16:46:55 GMT (4kb)

    Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox

    Authors: V.G.Gurzadyan

    Categories: physics.gen-ph astro-ph

    Comments: Refs added. To appear in The Observatory

    Subj-class: General Physics; Astrophysics

    Bit strings rather than byte files can be a mode of transmission both for intelligent signals and for travels of extraterrestrial life. Kolmogorov complexity, i.e. the minimal length of a binary coded string completely defining a system, can then, due to its universality, become a key concept in the strategy of the search of extraterrestrials. Evaluating, for illustration, the Kolmogorov complexity of the human genome, one comes to an unexpected conclusion that a low complexity compressed string - analog of Noah's ark - will enable the recovery of the totality of terrestrial life. The recognition of bit strings of various complexity up to incompressible Martin-L\"{o}f random sequences, will require a different strategy for the analysis of the cosmic signals. The Fermi paradox "Where is Everybody?" can be viewed under in the light of such information panspermia, i.e. a Universe full of traveling life streams.

    http://arxiv.org/abs/physics/0508010


  • Next message: LARRY KLAES: "SETI bioastro: Fw: Featuring Cornell: Science Cabaret"

    This archive was generated by hypermail 2.1.6 : Tue Sep 27 2005 - 17:31:10 UTC