computation by competing patterns
Posted: June 7th, 2010, 7:01 pm
Following previous results on Life-like rules B2/S2345678 and B2/S23456. We have developed more extended connections with channels to implement a NOT-MAJORITY adder, now in Life B2/S2345.
We have constructed with Golly (very useful for our constructions) a schematic diagram to get a NOT-MAJORITY adder by competing patterns. Such configuration runs on 1,402 × 662 lattice.
However, we accept that NOT gate is not the better implementation (it is a trick really). So, we have explored some variations to change values on the line but with unsuccessful, and I would be very grateful if you could find a configuration to get a best NOT gate at this way.
You can see and download this stuff including RLE files for each input of this adder, since:
http://uncomp.uwe.ac.uk/genaro/Diffusio ... S2345.html
Genaro
We have constructed with Golly (very useful for our constructions) a schematic diagram to get a NOT-MAJORITY adder by competing patterns. Such configuration runs on 1,402 × 662 lattice.
However, we accept that NOT gate is not the better implementation (it is a trick really). So, we have explored some variations to change values on the line but with unsuccessful, and I would be very grateful if you could find a configuration to get a best NOT gate at this way.
You can see and download this stuff including RLE files for each input of this adder, since:
http://uncomp.uwe.ac.uk/genaro/Diffusio ... S2345.html
Genaro