thomasabishop/eolas
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Last Sync: 2022-06-05 09:30:04

Browse source
This commit is contained in:
tactonbishop 2022-06-05 09:30:04 +01:00
parent 841b4cba7b
commit 94dfa7f24a
2 changed files with 10 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
Hardware/Logic_Gates/Logic_gates.md
View file

@ -9,3 +9,9 @@ tags:
# Logic gates
Logic gates are the basic building blocks of digital computing. **A logic gate is an electrical circuit that has one or more than one input and only one output.** The input controls the output and the logic is isomorphic with [Boolean connectives](../../Logic/Truth-functional_connectives.md) defined in terms of [truth-tables](../../Logic/Truth-tables.md).
> [A gate consists in] three connections where there may or may not be some electricity. Two of those connections are places where electricity may be put into the device, and the third connection is a place where electricity may come out of the device. (Scott, 2009)
## References
Scott, J. Clark. 2009. _But how do it know?: the basic principles of computers for everyone_. Self-published.

8
Hardware/Logic_Gates/Nand_gate.md
View file

@ -3,7 +3,7 @@ tags:
- Logic
- Electronics
- Hardware
- logic-gates
- logic_gates
---
# NAND gate
@ -32,9 +32,9 @@ Diagram representing NAND gate:
* It is only when both switches are on, that the output is off (corresponding to `true` `true` )
This is the exact opposite to the truth-conditions for `AND`.
This is the exact opposite to the truth-conditions for AND.
## Transliterating the logic truth table to the switch behaviour
## Transliterating the logic truth-table to the switch behaviour
We can now present a truth table for NAND along side that for AND:
@ -59,7 +59,7 @@ We can see that it inverts the value of AND.
## Significance of the NAND gate: functional completeness
> **Equipped with just a NAND we can represent every other possible logical condition within a circuit.**
In practice, it is more efficient to use specific dedicated gates for the other Boolean connectives but in principle the same output can be achieved through NANDs alone.
In practice, it is more efficient to use specific dedicated gates (i.e OR, AND, NOT etc) for the other Boolean connectives but in principle the same output can be achieved through NANDs alone.
## More complex outputs from combining NANDS