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

• Previous message: LARRY KLAES: "SETI public: On the potential of extrasolar planet transit surveys"

Paper (*cross-listing*): physics/0508010
Date: Mon, 1 Aug 2005 20:13:14 GMT (4kb)

Title: Kolmogorov Complexity, String Information, Panspermia and the Fermi
Paradox

Authors: V.G.Gurzadyan
Comments: To appear in The Observatory
Subj-class: General Physics
\\
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 , 4kb)

• Previous message: LARRY KLAES: "SETI public: On the potential of extrasolar planet transit surveys"

This archive was generated by hypermail 2.1.6 : Mon Aug 08 2005 - 20:01:52 UTC