OCA circuit discussion thread

[KittyTac]

A thread for discussing circuits in OCA.

I made a circuit in Hutton32 that lets only one signal pass forward, after that it turns them right (but it rejects longer signals):

Code: Select all

x = 8, y = 4, rule = Hutton32
2.3QT$2IpAIpA3I$5.L$5.L!

A variation that discards the signals instead:

Code: Select all

x = 8, y = 4, rule = Hutton32
2.3QT$2IpAIpA3I$5.pA!

[Redstoneboi]

This one works in jvn29.

Code: Select all

x = 9, y = 3, rule = JvN29
5.pA3I$M3IpAJR$4.2QR!

[KittyTac]

This one works in jvn29.

Code: Select all

x = 9, y = 3, rule = JvN29
5.pA3I$M3IpAJR$4.2QR!

That's just a period halver.

[Redstoneboi]

This one works in jvn29.

Code: Select all

x = 9, y = 3, rule = JvN29
5.pA3I$M3IpAJR$4.2QR!

That's just a period halver.

right, suggestions on what machines i should make in jvn rules?

[KittyTac]

This one works in jvn29.

Code: Select all

x = 9, y = 3, rule = JvN29
5.pA3I$M3IpAJR$4.2QR!

That's just a period halver.

right, suggestions on what machines i should make in jvn rules?

Anything reusable that can drain all of the signals from a loop without permanently damaging the loop.

[Redstoneboi]

Code: Select all

x = 52, y = 2, rule = JvN29
IpAIpAIpAIpAIpAIpAIpAIpAIpAIpAMpAQ.pA2K4O2K4OK2OK3O4K3OK$JpAKpAKpAKpA
KpAKpAKpAKpAKpAKpAO3.2MI4MI2MIM2I2M3I4M3IMJ!

[ColorfulGabrielsp138]

Is there an XOR gate in JvN29?
I've assembled an AND gate and an OR gate {citation needed} but couldn't find an XOR gate to do what I wanted.

[AlbertArmStain]

Cross posting this:

Nope, it's Moore. The diagonals are necessary for pretty much everything.

Well, that changes things completely.

Complexity of Wave CA = (ln(12)/ln(2))*(12^9) ~ 1.85 * 10^10 bits
Complexity of vNCA = (ln(29)/ln(2))*(29^5) ~ 9.96 * 10^7 bits

So, Wave CA is more complex than von Neumann's CA.

I /think/ Hutton32 isn't able to do a logical NOT at all, since it can't universally destruct unlike the original JvN29 or Nobili32.

It can still destruct OTS cells, which is sufficient for logical negation.

That's quite ridiculous looking, I must say.

Yes, it's an AND-NOT coupled with a XOR gate. And the AND-NOT gate involves a crossover, which is another three XOR gates.

What exactly do you mean by a latch? If you want an R/S flipflop

Similar to an R/S flipflop, but more passive. It has two inputs, FLIP and TEST, and two outputs (ON and OFF), like so:

Code: Select all

x = 50, y = 21, rule = Nobili32
29.L$29.J$29.J$29.J$29.J$29.J$29.J$29.J$29.J$27.Q.J$IM15IM9I2pA4K2O
13KOK$27.QIL$29.L$29.L$29.L$29.L$29.L$29.L$29.L$29.L$29.J!

The set {fanout, latch, merge} is universal, as well as the more conventional set {fanout, NAND}. The advantage of the first one is that there is no synchronisation involved.

I'm sure you could do it in 128x128 with Nobili32.

I think I could manage a 32*32 Unit Life Cell in Nobili32. Here is the logic circuit:

Code: Select all

x = 28, y = 20, rule = Nobili32
5.5IL.IL$5.JL3KLI2pA2IpA2IpA2IL$5.J2ILpAKJ2pA2KpA2KpA2KpA$5.J2.4IJL2.
L2.L2.L$5.J2IL3.TpA2TpA2TpA2TpA$5.2JIpAIL.10TL$5.3JIpA2I10.L$2.3I3J2K
J.2J2L5J.L$2IpA3IpA3IpA.10IpAL$2.J3.J3IL.3LJ5L.2L$2.J3.2JpAK2I10.2L$
2.JL2KpA.JpAJ.10R2L$2.JLQ.J2.J2.RpA2RpA2RpA2R2pA$2.JI2pA2K.J3.J2.J2.J
2.2L$2.2JQ2IpAIJ3.pA2KpA2KpA3KL$2.2J3.J15.L$2.2J3KpA15KpA4I$2.J4.J$2.
J4KpA$7.J!

The pulses from the 8 neighbours enter from the left. The signal from the right should be directed to all neighbours. Periodically, a signal from the bottom updates the cell.

An on/off switch to go with it:

Code: Select all

x = 27, y = 14, rule = Nobili32
17.J$17.J$17.J$12.T2S2.J$7IM3IpA2IpA2.J$2IM7IpA.pAJL2.J$11.RpA2KQ.J$12.
3I2pA9KO$15.QIL$17.L$17.L$17.L$17.L$17.L!

Is there an XOR gate in JvN29?
I've assembled an AND gate and an OR gate {citation needed} but couldn't find an XOR gate to do what I wanted.

Were you going to make an adder?

[silversmith]

I am creating this to publish some circuits designed for use in cellular automata. This is intended for two different types of rules, where in many cases standard boolean circuits don't work directly in CA.

1. When a CA has elementary crossovers, but only the only elementary gate is ANDNOT, and other gates are much larger or more complicated. Most INT rules are of this type.
2. When a a CA has many elementary gates, but no elementary crossovers. An example would be Wireworld.

In both types, using standard boolean circuitry requires first converting the incomparable elements into much larger equivalents, which tends to make circuits unnecessarily large.

Circuity for type A rules should be optimized to use a minimal number of ANDNOT gates. Optionally, they can also use other gates if such a CA rule exists which has those gates(eg, circuitry with only ANDNOT and OR gates).

Circuitry for type B rules should have no crossovers, and optimized for least number of gates overall.

Here is some type B circuitry, made with an online circuit design program;
A crossover:

Screenshot from 2022-12-27 13-17-31.png (12.47 KiB) Viewed 871 times

A full adder

Screenshot from 2022-12-27 12-16-34.png (15.36 KiB) Viewed 871 times

A full subtractor

Screenshot from 2022-12-27 13-49-08.png (14.39 KiB) Viewed 871 times

[wirehead]

1. When a CA has elementary crossovers, but only the only elementary gate is ANDNOT, and other gates are much larger or more complicated. Most INT rules are of this type.
2. When a a CA has many elementary gates, but no elementary crossovers. An example would be Wireworld.

So what about my rule, WiredBrain? It is half WireWorld, so it fits case B, but because it's also B2/S, it fits case A too. Is there a case C somewhere I haven't looked, or does this rule belong solidly in the Hybrid Rules thread?

[silversmith]

So what about my rule, WiredBrain? ... Is there a case C somewhere I haven't looked, or does this rule belong solidly in the Hybrid Rules thread?

Well, if I understand the rule correctly it has both crossovers and a general set of gates, making it neither type A nor B. Since the rule has no major circuitry limitations, there isn't much point of using these circuits in your rule.

In other words, if you can construct any boolean circuit directly in a rule, just do that.

[PHPBB12345]

Hutton32 Inverter:

Code: Select all

x = 57, y = 9, rule = Hutton32
22.pBK$22.MpC$23.L.3IpA2Q.pAOpDO$22.IpAIpAIpA4.L.MN$14M8IpA9.pA23IK$
22.IpAIpAIpA4.J.MP$23.N.3IpA2Q.pAOpDO$22.IpB$22.pCO!