Comments on "synchronicity"

[Hide] original entry

It's curious the way things happen in parallel.

Case 1: Conway's "angel problem", open for for 25 years, suddenly seems to have been independently solved by four different people: András Máthé and Oddvar Kloster have proofs for an Angel of power 2, Brian Bowditch for an Angel of power 4, and Péter Gács for an angel of unspecified large power.

(Brief sketch of the problem: consider a game played by two players on an infinite chessboard. Play alternates. The first player has a single piece, called an Angel. On each move it can hop to a new square provided it doesn't move more than k units in either direction. The second player has an unlimited supply of pieces; on each move s/he places one of these pieces on any unoccupied square. The Angel isn't allowed to move to a square with a piece on. The first player wins if the Angel can keep moving for ever; the second player wins if s/he can box the Angel in. Who wins? Answer, it turns out: the Angel, even when k is as small as 2.)

The two strategies recently published for the Angel of power 2 are even very similar to one another: declare a connected region of the board (initially one half of it) unavailable, walk along its edge, and modify the region as squares get eaten. Perhaps the idea of this approach has been in the air for a while?

Case 2: within a couple of weeks of one another, two friends of mine independently make blog posts describing (or, in the latter case, referencing a Wikipedia description of) substantially the same programming technique and remark that it's a bit obscure and should be better known. The first happens to have a slightly more sophisticated version of the technique.

Edited, 2007-05-25, to fix a typo and to note:

Case 3: Cases 1 and 2 occurred at pretty much the same time. (I completely failed to notice this until a friend pointed it out.)

Case n+1: Cases 1, 2, ..., n occurred at pretty much the same time.

On 2007-05-10 at 00:18:15, Gareth Rees said:

In the Máthé proof, the bit I had most trouble with was the "trivial observation" at the start of section 2: "If for every positive integer n the Angel has a strategy to make n moves without jumping on eaten squares, then a suitable limit of these strategies gives a winning strategy for the Angel to move forever"

I wasn't sure in what sense a series of strategies could have a limit, suitable or otherwise. It was a good ten minutes before I remembered Kőnig's lemma.

On 2007-05-10 at 02:13:50, g said:

There's something just counterintuitive enough about Kőnig's lemma that it easily falls out of the brain...

On 2007-06-05 at 00:30:07, Buford T. Iannone said:

You know all that stuff you wrote about being a Christian but not anymore.

For various reasons, including the pattern it fits over at another atheist site, I don't believe your story.

I think you are lying about the whole thing.

On 2007-06-05 at 06:07:41, g said:

How very strange. I'm not lying about any of it. I'm sorry if that doesn't fit your preconceptions.

Post a comment:

Name:(will be shown with comment)
Email:(will be kept private)
Web page:(optional; will be linked from your name)
Secret word:(the secret word is two plus two)

You may use Markdown to format your comment, or just include HTML tags. All comments are moderated, so don't waste your time trying to abuse this.