Bistable switch: Difference between revisions
m other file formats |
Apple Bottom (talk | contribs) infobox |
||
| Line 1: | Line 1: | ||
{{ | {{Pattern | ||
|name = Bistable Switch | |||
|pname = bistableswitch | |||
|c = 43 | |||
|bx = 30 | |||
|by = 48 | |||
|discoverer = Paul Callahan | |||
|discoveryear = 1994 | |||
|life105 = true | |||
|life106 = true | |||
|plaintext = true | |||
|rle = true | |||
}} | |||
The '''bistable switch''' is a partial [[stable reflector]] discovered in 1994 by Paul Callahan. | The '''bistable switch''' is a partial [[stable reflector]] discovered in 1994 by Paul Callahan. | ||
Revision as of 09:46, 18 June 2016
| Bistable Switch | |||||||
| View static image | |||||||
| Pattern type | Miscellaneous | ||||||
|---|---|---|---|---|---|---|---|
| Number of cells | 43 | ||||||
| Bounding box | 30 × 48 | ||||||
| Static symmetry | Unspecified | ||||||
| Discovered by | Paul Callahan | ||||||
| Year of discovery | 1994 | ||||||
| |||||||
The bistable switch is a partial stable reflector discovered in 1994 by Paul Callahan.
Structure
The switch consists of elementary still lifes. More specifically, it uses a block and eater 1, together with a century eater consisting of three eater 1s surrounding a central beehive. In addition to these permanenet catalysts, there is an extra still-life to represent the state. This can either be a block or boat, depending on the state.
Reflecting ability
The switch was found when trying to build a stable reflector. When the glider collides with the boat, it is converted into a block and a glider is emitted perpendicular to the incident glider. When a glider (on a different path) collides with the block, it restores the boat, producing an output glider in the same direction to the input glider.
Memory storage
If a glider enters the switch when it is in the wrong state, the glider merely permeates through the device without affecting it. This means that any combination of input gliders, as long as they are sufficiently separated, will not destroy the device. This gives the conduit the ability to store information:
Let the inputs be called SET and RESET. The outputs can be designated SET SUCCESS, RESET SUCCESS, SET FAILURE and RESET FAILURE. The truth table is shown below:
| Input | Current state | Next state | Output |
|---|---|---|---|
| SET | 0 | 1 | SET SUCCESS |
| SET | 1 | 1 | SET FAILURE |
| RESET | 0 | 0 | RESET FAILURE |
| RESET | 1 | 0 | RESET SUCCESS |