Episode 4.09 - Simplification of Boolean Expressions

from Geek Author · host David Tarnoff

In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they'll be cheaper, smaller, and faster. That's why.

Episode metadata supplied by the publisher feed · Published Dec 6, 2019

Embed this episode

Attribution link and audio player

NOW PLAYING

Episode 4.09 - Simplification of Boolean Expressions

0:00 10:13

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Geek Author?

This episode is 10 minutes long.

When was this Geek Author episode published?

This episode was published on December 6, 2019.

Can I download this Geek Author episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.

URL copied to clipboard!