Monthly Archives: April 2011

Gromov’s entropy for sheafs

The entropy   of a set is the logarithm of the number of elements in . Gromov’s remarkable insight (which he elaborated on in a course I attended a decade ago) by taking the logarithm we can ensure additivity: . Perhaps one should also … Continue reading

Posted in Uncategorized | Leave a comment

Should computers enjoy solving puzzles?

People enjoy solving puzzles. In real life, solving puzzles is useful, for instance recognising a camouflaged predator.  But this is not a sufficient reason to be rewarded (emotionally) for solving the puzzle, rather than just for the outcome. In a … Continue reading

Posted in Uncategorized | 1 Comment