Honeybit

From LifeWiki
(Redirected from Honey bit)
Jump to navigation Jump to search
Honeybit
x = 294, y = 106, rule = B3/S23 103bo$103b3o$106bo$105b2o4$106b2o$94b2o5b2o2b3o2b2o$94b2o5bo2bobo4b2o$ 102bo3bob2obo$98b2o5bo3b2o$98b2o4$121b2o$121b2o2$118b2o5b2o$118b2o5b2o 4$114bo$115b2o$114b2o$8b2o$8b2o274b2o$284b2o2$11bo64b2o$9bobo64b2o205b o$7b2o274bobo$7b2o6bobo266bobo$7b2o2bo4bo57bo202bo6bo2bo$2o6b3o63bobo 200bo5bo$bo7bo67b2o204bo2bo5b2o$bobo64bobo6b2o204b3o6bo$2b2o65bo4bo2b 2o211bobo$75b3o6b2o204b2o$76bo7bo$82bobo$20bobo59b2o$21b2o248bo$21bo 249bobo$271b2o$63bobo$63b2o$64bo2$19b2o$19b2o252b2o$273b2o$16b2o126bo$ 16b2o47b2o78b2o129b2o$65b2o77b2o130b2o2$19b2o47b2o$19b2o47b2o203b2o$ 273b2o2$65b2o$65b2o$172b4o56b4o$172bo3bo55bo3bo$172bo59bo$173bo2bo56bo 2bo$52b2o58b2o$50bo4bo54bo4bo44b2o$56bo59bo42bo2bo$34b2o14bo5bo53bo5bo 42bo2bo$35bo15b6o54b6o43b2o$30b3o2b2o197b2o$28b3obo3bo197b2o$28bo4bob 2o122b2o$32bobo7b2o115b2o$30b2obo4bo2bobo187b2o$30bo3bob3o3bo188b2o$ 30b2o2b3o$31bo202b2o$31b2o201b2o2$276bo$275b2o$260b2o5b2o6bobo$260b2o 5b2o$236bo$236b2o26b2o20bo$235bobo26b2o18b2o$284bobo3$217b2o67b2o$216b obo66b3o$216bo7bo58b2ob2o$215b2o6b3o57b2ob2o3b2o$222b2o2bo4bo51b2obo4b 2o$222b2o6bobo52bo$222b2o$224bobo$226bo$280b2o$280bo$223b2o56b3o$223b 2o58bo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] #C [[ THUMBNAIL THUMBSIZE 2 HEIGHT 360 GPS 20 ZOOM 12 X 13 Y 15 LOOP 120 AUTOSTART ]]
Pattern type Memory cell
Number of cells 11
Bounding box 4 × 8
Discovered by Brice Due
Year of discovery 2006

The honeybit reaction is an elegant destructive-read memory cell used by Brice Due in his OTCA metapixel. It involves a glider colliding with a beehive (hence the name "honeybit"), that converts it to a block and pond. The beehive can be thought of as a value of "0" stored in the memory unit, and the block and pond constellation is a "1". A passing LWSS can then test for the presence of the pond. If a collision occurs, the LWSS and the honeybit constellation are mutually annihilated and the memory cell is restored to its "0" state, with only the original beehive remaining.

If the pond is not present, the LWSS passes by the beehive without affecting it. This means that a test input has an output (the LWSS) for the "0" case, but not for the "1" case. For an example of an alternative memory cell mechanism with both "0" and "1" outputs, see demultiplexer.

As a HWSS eater

The honey bit is also an interesting eater for an HWSS, as shown below. On the opposite side from the LWSS input path, an HWSS colliding with the block and pond constellation also happens to create the honeybit beehive, plus the exact same reset glider used in the above memory unit.

x = 25, y = 9, rule = B3/S23 2b2o$o4bo16b2o$6bo14bo2bo$o5bo14bo2bo$b6o15b2o3$21b2o$21b2o! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]] #C [[ THUMBNAIL THUMBSIZE 2 HEIGHT 320 THEME 6 GPS 15 LOOP 100 ZOOM 16 AUTOSTART PAUSE 2 ]]
(click above to open LifeViewer)
RLE: here Plaintext: here

External links