How the Algebra of Boole Simplifies Circuit Analysis - Math Foundations - N J Wildberger
Offered By: Insights into Mathematics via YouTube
Course Description
Overview
Learn how the Algebra of Boole simplifies circuit analysis in this 29-minute video lecture from the Math Foundations series. Explore a new approach to encoding the effects of inputs on logic gate circuits using algebraic expressions based on the Algebra of Boole, which treats AND and XOR operations as primary. Compare this method to classical Boolean algebra and discover why it offers a simpler and more powerful framework for engineers and computer scientists. Examine two key examples demonstrating both approaches, and gain insights into tackling common engineering problems related to logic circuits and gates.
Syllabus
Introduction
Using the Algebra of Boole
Using Boolean Algebra
A main task with logic gates
Using Boolean Algebra
Taught by
Insights into Mathematics
Related Courses
Build a Modern Computer from First Principles: From Nand to Tetris (Project-Centered Course)Hebrew University of Jerusalem via Coursera Digital Systems: From Logic Gates to Processors
Universitat Autònoma de Barcelona (Autonomous University of Barcelona) via Coursera How Computers Work: Demystifying Computation
Raspberry Pi Foundation via FutureLearn Digital Electronic Circuits
Indian Institute of Technology, Kharagpur via Swayam Understanding Maths and Logic in Computer Science
Raspberry Pi Foundation via FutureLearn