Tag

#Information Theory

14 articles

Explore (search, categories, archive)

Sorting is computationally harder than playing chess

I will argue below that sorting of a big array, using only comparison, is inherently harder than solving the problem of choosing the best next move on a chess game. One could say that it is not fair t...

8 min read

DNA and the fabric of the Universe

The genetic code seems to not be enough to describe the complexity of a human being. In fact, it seems too small to describe most of the life forms. We could assume that the genetic code has all the i...

7 min read

Genetic code (DNA) is not enough

Photo: wikipedia.org Genetic code (DNA) could be seen as the best compression algorithm that we have ever seen. Just think about it: in only around 1 GBytes, DNA could store the information to create...

5 min read

Mathematical incompletness and life

A friend told me once that we are living in an Universe full of unprovable truths. He was referring to the Gödel's incompleteness theorems. Without being very formal, this says that there are many mat...

4 min read