| << Chapter < Page | Chapter >> Page > |
Card 3 / 3:
logically complete
A set of circuit gates or logical elements is logically complete if any boolean function representable by a truth table can be realized using only gates or elements from that set.
| Previous Card | ← Previous Card Button |
| Next Card | → Next Card Button |
| Flip Card | ↑ / ↓ / Return / Space |
Notification Switch
Would you like to follow the 'Fundamentals of computer engineering' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|