Tag
Please check my informal introduction to "Kolmogorov complexity" if you are not familiar with the subject. In this article I will approach some less discussed ramifications of it and hopefully some ne...
I want to give you an intuition about Kolmogorov complexity, without being very formal. Basically, Kolmogorov complexity defines a measure of how small can you compress a certain string of characters....
"P equals NP?" is a million dollars unsolved problem. Introduction "P" is the class of problems where we have algorithms that solves the problem in polynomial time. "NP" is the class of problems havin...
A virtual machine is a common example of simulation. It can take the description of a (virtual) "computer" state and continue the execution from that point on. You can simulate a huge computer given a...
We have this requirement: "Create the smallest program that will print the full text of the play Othello by William Shakespeare". I should warn you that the requirement hides a trick and you will hate...
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...
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...