Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox



>From the physics archive (though perhaps good luck figuring it out):

From: V. G. Gurzadyan
Date (revised v2): Mon, 26 Sep 2005 16:46:55 GMT (4kb)

Title: 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.

<URL: http://xxx.lanl.gov/abs/physics/?08010 >

--
Lt. Lazio, HTML police | e-mail: jlazio@xxxxxxxxxxx
No means no, stop rape. | http://patriot.net/%7Ejlazio/
sci.astro FAQ at http://sciastro.astronomy.net/sci.astro.html
.



Relevant Pages

  • Re: =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>>As far as Kolmogorov Complexity, let's look at the basic definition one ... When discussion a string of characters. ... >>>the degree of a string's compressibility. ... >>>plays an important role in the concept of chaos. ...
    (talk.origins)
  • =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>As far as Kolmogorov Complexity, let's look at the basic definition one ... When discussion a string of characters. ... > And thus Pi has low functional complexity, low Kolmogorov Complexity. ... >>plays an important role in the concept of chaos. ...
    (talk.origins)
  • Re: Just for fun...
    ... complexity in practical scenarios... ... corresponding complexities for a given string can differ at most by a constant ... When I first learned about the concept of compression, ... surprise in the questions/issues being discussed, ...
    (comp.lang.ruby)
  • Re: Stephen Wolfram vs. Charles Darwin on natural selection
    ... "Incomputability of Kolmogorov complexity ... there is no program which takes a string s as input and ... description indeed describes one organism uniquely. ...
    (sci.bio.evolution)
  • Re: Entropy
    ... You'll find there exactly the same elementary result I stated above, namely that the complexity is language dependent, and that for any two languages the complexity of a given string differs by a constant. ... In the Wiki page there is no mention of "infinite string". ... Kolmogorov complexity but unfortunately failed. ...
    (comp.compression)