Kolmogorov complexity, string information, panspermia, and the Fermi paradox

Bit strings rather than byte files can be a mode of transmission both for intelligent signals and for extraterrestrial (ET) life. Kolmogorov complexity, i.e., the minimal length of a binary-coded string completely defining a system, can then, because of its universality become a key concept in the strategy of the search for ETs. Evaluating, for illustration, the Kolmogorov complexity of the human genome, one comes to the unexpected conclusion that a low-complexity compressed string - an analogue 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-Lof random sequences will require a different strategy for the analysis of the cosmic signals. The Fermi paradox 'Where is everybody?' can be viewed in the light of such information panspermia, i.e., a Universe full of travelling life streams.