ConwayLife.com

I am testing collisions in the Generations rule StarWars, and I want to attempt to make a computer, prefferably Turning. Before I go anywhere further, I was curious about the rule having computers. Thanks!

If you can create a binary signal and a NAND gate for such signals in a given rule, that would be sufficient to be able to make a computer in that rule. A NOR gate can be used instead of a NAND gate, but additional gates and functions will make the computer more compact. A Fredkin gate can perform any logic function as well. The Fredkin gate is a three input gate that simply swaps two signals or sends them straight through depending on the state of the third input. The third output of the Fredkin gate is simply the control signal going straight through the gate. The reason the Fredkin gate has three outputs gets to be a long explanation but if you are interested a Google search will reveal a lot about it. A Heisenburp reaction would be perfect for making a Fredkin gate since the control signal can go straight through unaffected.

An infinite memory storage would be necessary for a universal computer. This can be accomplished by either using sliding-block memory, or a tape extending out to infinity, or both.

I am assuming, of course, that you want your computer to be universal.


You also need a fanout device to multiply signals. Here is one that I quickly bolted together for Star Wars:
I suggest making your computer out of asynchronous circuitry like this, if possible.

Thanks for the multiplier. I do have a head start, though, as I am using MCell's StarWars collection (Using Golly).

Well, I've already built a SR-Latch with NOR gates (and created a simple NAND gate), so I'd say you can!