nope, what you do is you have an inverted and statement, but the inversion comes after the and
here's my best boolean ascii skills! ha look at the not:<
and not
| |
| |
V V
___
a-------| \____|\o---
b-------|___/ |/
yer way works too but it's redundent, a or a always = a b or b always = b
it'd be
or
|
V
___
b---\ \____
b---/___/ \
\ ___
\-------| \____|\o---
____|___/ |/
/
___ /
a---\ \____/
a---/___/
a.or.a|b.or.b|a.and.b|negation.a.and.b aka nand|
| | | |
V V V V
____
a|b|a v a|b v b|a /\ b| a/\b
0|0|0 |0 |0 |1
0|1|0 |0 |0 |1
1|0|1 |1 |0 |1
1|1|1 |0 |1 |0
sorry i bet a lot of u know this but i jsut got carried away, logic is so fun!=D especially trying to draw it in ascii;-)
srmaietta <srmaietta@...> wrote:
It looks to me like you just NOT (invert) a&b separately then run
them into the OR function. Out comes the NAND configuration.
~Stv
(OT: new, "I think I've got it" 2 panel posted)
--- In SergeModular@yahoogroups.com, darkstr1746@c... wrote:
> I'm sorry, but i'm a dumb ass. Is there another way to explain
this. I just don't get it.
> kind regards
> john duval
>
> -------------- Original message --------------
>
> Hi James,
> to construct a NAND gate you have to OR two NOT gates:
> The truth table for NAND is
> A B A NAND B
> 0 0 1
> 0 1 1
> 1 0 1
> 1 1 0
> Now:
> A B NOT A NOT B (NOT A) OR (NOT B)
> 0 0 1 1 1
> 0 1 1 0 1
> 1 0 0 1 1
> 1 1 0 0 0
> The cool thing about the BLOG module is that there are two NOTs so
you can actually construct the above gate easily.
> I hope this helps!
> Yannis
Keep on Patchin'!Do you Yahoo!?
New and Improved Yahoo! Mail - 100MB free storage!