Had lectures yesterday with Paul Vitany. I really like the whole subject of Kolmogorov complexity. The fact that it’s uncomputable intrigues me even more. Prof. Harju mentioned today that there would be a lecture at the end of the course on uncomputable problems, like the 3×3 matrix factorisation problem. I’d really like to try some of these problems on Tom’s machine.
Another idea I had was to be able to write a program (on Tom’s machine) that generates all possible parse trees of a context sensitive word (based on a given grammar) in O(1) time. Other ideas come from both Kolmogorov complexity and the possibilty of characterising the set of all possible context free grammars. I’ll probably drop man_monaghan and Tom a mail on this later.
In other news the other students on the course threw a good party for my birthday last night. Beer, pizza, fantastic Spanish wine and Japanese cookies. As per usual Celard, Mihai and I were the only ones to last the party Mihai has a guitar and sang a few Romanian folk songs, he’s pretty damn good.
On the way home Celard had the bright idea to call friends. I called Dez first, when I told him it was my birthday and I was drunk he seemed to accept my phone call as a logical conclusion. Lori was a bit more tired, but it was fun to wake her.