ANY (Ternary Gate): Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
(→AANY) |
No edit summary |
||
Line 1: | Line 1: | ||
<big><b>Any</b></big> | <big><b>Any</b></big> | ||
[[File:ANY_GATE.png|thumb|alt=Any Gate Symbol|Any Gate Symbol]] | |||
[[File:BCT_CON.png|thumb|BCT Any Gate]] | |||
== Uses == | == Uses == | ||
Line 8: | Line 10: | ||
== Truth Tables == | == Truth Tables == | ||
=== ANY === | === ANY === | ||
<div class="tt"> | <div class="tt"> | ||
<table class="tt"> | <table class="tt"> |
Revision as of 18:59, 24 January 2025
Any


Uses
ANY gate is the ternary equivalent to the binary OR gate.
The negated form NANY is a universal gate just like binary NOR. Every other logic gate can be made with the correct partern of NANY gates.
Truth Tables
ANY
ANY | B | |||
- | 0 | + | ||
A | - | - | - | 0 |
0 | - | 0 | + | |
+ | 0 | + | + |
ANY | ||
A | B | Y |
- | - | - |
- | 0 | - |
- | + | 0 |
0 | - | - |
0 | 0 | 0 |
0 | + | + |
+ | - | 0 |
+ | 0 | + |
+ | + | + |
NANY
NANY | B | |||
- | 0 | + | ||
A | - | + | + | 0 |
0 | + | 0 | - | |
+ | 0 | - | - |
NANY | ||
A | B | Y |
- | - | + |
- | 0 | + |
- | + | 0 |
0 | - | + |
0 | 0 | 0 |
0 | + | - |
+ | - | 0 |
+ | 0 | - |
+ | + | - |