Previous post in topic Next post in topic First post in topic Table of contents There seems to be a tradeoff. On the one hand, you can have a complicated machine, and easy programming. On the other, you can have a simple machine, but the programming gets weird and obscure.
Podcast: Play in new window | Download (Duration: 6:14 — 3.9MB) | Embed
Core Wars In 1984, the game Core Wars was written and introduced to the public. Contestants write programs in a special language called redcode, and attempt to halt or overwrite the other programs in order to be the last game standing. Here’s a beginner’s guide to redcode The beginners’ guide to Redcode Here is a …
Podcast: Play in new window | Download (Duration: 4:52 — 3.1MB) | Embed
Darwin, the game In the summer of 1961, a game was created. It was a programming game. Players would write programs that would compete against one another to try and copy themselves as often as possible, and attempt to deactivate the other programs. Here are a couple of links with more information on the game. …
Podcast: Play in new window | Download (Duration: 4:52 — 3.0MB) | Embed
Meanwhile, elsewhere on the planet I wanted to do something special for episode 100. It snuck up on me, and I never figured out what to do. I decided to share a couple of other projects, outside of the podcast. One is a blog series I’m working on, about how computers compute. The other is …
Podcast: Play in new window | Download (Duration: 5:46 — 3.5MB) | Embed
256 simpler games In the 1980/s, Stephen Wolfram began considering and experimenting with elementary cellular automata. These are, instead of a 2-dimensional grid, just a one-dimensional row of cells or squares. At least one of these simpler games, rule 110, turns out to be Turing complete, just like Conway’s game of life. Here are links …
Previous post in topic Nex post in topic First post in topic Table of contents It’s Monday morning. I’m sitting at my desk, using my fingers to hit keys in more or less the right order. I’m using 26 letters to construct words and sentences in order to convey my meaning. Well, 26 letters, and …
Podcast: Play in new window | Download (Duration: 8:43 — 5.5MB) | Embed
Conway’s game of life In the previous episode we talked about cellular automata, and John von Neumann’s self-replicating system. While he used cellular automata with 29 different states for each cell, a much simpler game is capable of creating self-replicating systems. A British mathematician created his game of life in the 1950/s. In 1970, an …
Podcast: Play in new window | Download (Duration: 7:50 — 4.8MB) | Embed
Von Neumann’s cellular automata John Von Neumann began considering the idea of self-replicating systems and machines in the 1940/s. Originally, he considered actual robots, who could build other robots that could build other robots. He quickly became bogged down by the complexity of real world machinery, and the expense of providing enough parts for a …
Podcast: Play in new window | Download (Duration: 5:48 — 3.6MB) | Embed
Barricelli’s numeric organisms Before Core Wars, or the computer game Darwin, just about as soon as a computer was built that could run the program, a rather obscure Italian scientist named Barricelli, did pioneering experiments in digital life. While his work remains largely unknown, it does demonstrate how people have been working on evolving computer …
Podcast: Play in new window | Download (Duration: 7:26 — 4.5MB) | Embed
The dreaded local minimum While talking about various and sundry methods of simulating natural processes like evolution in order to solve problems, the concept of a local minimum has cropped up from time to time. Today, we take a closer look at it, and some of the ways to escape.