Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox
| dc.creator | Gurzadyan, V. G. | |
| dc.date | 2005-08-01 | |
| dc.date | 2005-09-26 | |
| dc.date.accessioned | 2026-07-07T06:26:47Z | |
| dc.date.available | 2026-07-07T06:26:47Z | |
| dc.description | 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ö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. | |
| dc.description | Refs added. To appear in The Observatory | |
| dc.identifier | https://arxiv.org/abs/physics/0508010 | |
| dc.identifier | http://arxiv.org/abs/physics/0508010 | |
| dc.identifier | Observatory 125 (2005) 352-355 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/97214 | |
| dc.subject | General Physics | |
| dc.subject | Astrophysics | |
| dc.title | Kolmogorov Complexity, String Information, Panspermia and the Fermi Paradox | |
| dc.type | text |