In the early 1990s, Solipsys Limited was founded to cover a range of various activities. Over time these have evolved primarily into a selection of talks and workshops covering a range of mathematical ideas.
Visit solipsys.co.uk → On Hacker News May 2010 – Mar 2025
Software Engineering 9Math & Algorithms 8Career & Management 6Science & Space 4Life, Learning & Writing 4Tools & Productivity 2
Gosper's Glider Gun in Conway's Game of Life I'd known of Conway since my early teens. I remember reading about his Game of Life in an old Scientific American someone gave me. The article (a quick search tells me) was published in October 1970, so I'm guessing I saw it in the early 70s, perhaps 1972. I was hooked.
Oh, and - added later - the original from PG is undated, but the "enhanced" version below it was on the C2 wiki in 2003/2004 and possibly earlier, so don't for one minute think it's supposed to be up-to-date, or refer to modern version of these languages.
This page has been Tagged As Software This is a truism that lots of people quote, but it can be hard to remember, especially in the heat of battle (as it were). Rather fortunately it came to mind just when needed, as I found something completely unexpected.
It's incomplete, but probably a reasonable place to start. If you think there's something that desperately need to be fixed then send me email and I'll look at it.
During the second World War, fighter pilots would scramble to take off. As they bumbled down the grass runway, engines open at full throttle, trying to take off on a short, bumpy track with a full load of fuel and ammunition, their heart would stop when the engine mis-fired. Was the fuel mix too rich, or too lean?…
Sieve of Eratosthenes animation Source: Wikipedia[0] One of the things we need to do when finding Perrin Pseudo-Primes is to recognise prime numbers so we can see if the numbers predicted by the Perrin test to be prime, are. So we need to generate primes. For small primes (for some definition of "small") this can be…
In Part 2 article I'll describe how I personally would write the code specified in Part 1. I'm not claiming this is in any sense objectively the best, and I'm certainly not suggesting it's the only.
You may feel like you've seen this before. If you have, skip to the end where I talk about a formula, and discuss the relevance to parameters in computer hashing algorithms. In particular, I'm going to talk about how large hash spaces should be to avoid collisions with a given level of probability. If there are just…
I've now stopped accepting new versions, so please don't send me any more. However, there has been such a strong reaction to this that I intend to offer another opportunity for people to write simple code and have it analysed and compared with others.