Category: Fun and trivia

  • Danish social experiment from 1969

    In the Danish movie Broen (Om Fordomme) two groups who can not stand each other have to collaborate in order to build a bridge. The movie is visible online.

  • Thank you Scott!

    I just read this blog post by Scott Hanselman (I’m a phony. Are you?), and it was a bit of a group therapy moment. It’s nice to know that you’re not alone in something!

  • Data-parallelism vs Task-parallism

    Adapted from an article I found by Googlin’. There are many ways to define this, but simply put: Task parallelism is the simultaneous execution on multiple cores of many different functions across the same or different datasets. Data parallelism (aka SIMD) is the simultaneous execution on multiple cores of the same function across the elements […]

  • Idea: Automatic theft prevention in public spaces

    Background When I’m at the library, I’d like to be able to go to the toilet, without collecting all my stuff from the table. Part of the solution is to have a camera installed that films all the tables, but assuming we can hire someone to look at the camera-feeds, that person might not notice […]

  • How does the number of leafs on a tree grow with the height of the tree?

    As a was lying on my back in the University park to day, resting a bit between reading papers (more on that later), I looked up at a pine tree and asked myself a very computer sciencey question. How does the number of needles L on the tree grow, as the tree grows taller? If […]

  • Back on my regimen

    Sometimes my head hurts from all the papers I have to read. All the lines of software I have to code. All the pages of high quality scientific output I have to write. All the people I have to impress. At those times I’m a little whiner, a weak quiter, feel so sorry for myself, […]

  • Simulating the Golden Balls game show

    In this eposide of Golden Balls, an inspired event takes place: I retold the event at DIKU APL lunch (nice to have a job where game theory is a valid conversation topic), and we had a conversation about it. At first I thought this was prisoners dilemma, but it was quickly revealed that it is […]

  • Simple programs for simple turing machines

    I’ve always wanted to understand Turing Machines better. I believe that the best understanding comes from the intuition developed by solving puzzles. So here, I give myself some challenges. Solve simple problems by writing programs for a simple Turing Machine, using this simulator: http://ironphoenix.org/tril/tm/

  • Creating visually random images

    How complicated does a mathematical function, pseudorandom(x), have to be to create something that seems random, and how do you check whether it seems random? Looking at a long list of numbers is not a good way, because our ability to look at long lists of numbers is very limited. Our ability to look at […]

  • Never forget your password again, version 1

    The recommended practice is to have different passwords on different websites. But how do you remember all those passwords without storing them somewhere? The tricks is, you don’t. You remember a single strong password, and use a mechanism to generate other passwords from that. This is not for securing government secrets, but should work for […]