Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox

Details Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox

2005-08-01

arxiv.org/abs/physics/0508010v2

Observatory 125 (2005) 352-355

Physics

General Physics

Refs added. To appear in The Observatory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615878