Kolmogorov complexity is a measure of the complexity of data. It is simple to define but appears to have deep implications. The K. complexity of a string is defined as the size of the simplest possible program, with respect to a given underlying computer, that can generate the data. For example, the string “AAAAAA” has lower […]
Pages
-
Recent
Recent comments
- Covid-19 and time — Monomorphic on The year and decade in review. 2020s: orderly peace?
- Monomorphic - Photography on The inexhaustible wealth of appearance, information and specificity
- Johan on Technology and utilitarianism
- J C on Objective and subjective reality; perspectivism
- Rose Schnor on Technology and utilitarianism
Archive
Bioinformatics, software, CS
Friends
Japan
Philosophy
Swedish