forked from YovM/Algorithms
* feat: Add recursive implication function for lists * Update imply_gate.py * Update imply_gate.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> |
||
|---|---|---|
| .. | ||
| README.md | ||
| __init__.py | ||
| and_gate.py | ||
| imply_gate.py | ||
| karnaugh_map_simplification.py | ||
| multiplexer.py | ||
| nand_gate.py | ||
| nimply_gate.py | ||
| nor_gate.py | ||
| not_gate.py | ||
| or_gate.py | ||
| quine_mc_cluskey.py | ||
| xnor_gate.py | ||
| xor_gate.py | ||
README.md
Boolean Algebra
Boolean algebra is used to do arithmetic with bits of values True (1) or False (0). There are three basic operations: 'and', 'or' and 'not'.