Boolean Algebra: Sample Problems
In this video, I work through some sample problems relating to Boolean algebra. Specific, I work through examples of translating equivalences from logical or set notation to Boolean notation, and also a derivation using Boolean equivalences.
From playlist Discrete Mathematics
Boolean Algebra 2 – Simplifying Complex Expressions
This video follows on from the one about the laws of Boolean algebra. It explains some useful interpretations of the laws of Boolean algebra, in particular, variations of the annulment and distributive laws. It goes on to demonstrate how Boolean algebra can be applied to simplify comple
From playlist Boolean Algebra
Boolean Algebra 1 – The Laws of Boolean Algebra
This computer science video is about the laws of Boolean algebra. It briefly considers why these laws are needed, that is to simplify complex Boolean expressions, and then demonstrates how the laws can be derived by examining simple logic circuits and their truth tables. It also shows ho
From playlist Boolean Algebra
From playlist Week 1 2015 Shorts
A Quick Overview of BOOLEAN ALGEBRA (symbols, truth tables, and laws)
Error in Video (9:32, 11:30): When talking about the last laws in the columns for equivalences, I say "DeMorgan's Law" when I mean to say "Distributive Law". In this video on #Logic, we learn the basics of #BooleanAlgebra and compare the notation for propositional logic with it. We cover
From playlist Logic in Philosophy and Mathematics
The Algebra of Boole is not Boolean algebra! (III) | Math Foundations 257 | N J Wildberger
We continue discussing George Boole's original algebra which can be framed as arithmetic over the bifield B_2={0,1} and vector spaces/algebra over it. We have seen how to reformulate Aristotle's syllogistic construction in terms of Boole's algebra, and use simple algebra to prove his syllo
From playlist Boole's Logic and Circuit Analysis
Boolean Algebra 3 – De Morgan’s Theorem
This video follows on from the one about simplifying complex Boolean expressions using the laws of Boolean algebra. In particular this video covers De Morgan’s theorem and how it can be applied, along with the other laws, to simplify complex Boolean expressions. It includes worked exampl
From playlist Boolean Algebra
Francesco Ciraulo: Notions of Booleanization in pointfree Topology
The lecture was held within the framework of the Hausdorff Trimester Program: Types, Sets and Constructions. Abstract: Boolean algebras play a key role in the foundations of classical mathematics. And a similar role is played by Heyting algebras for constructive mathematics. But this is
From playlist Workshop: "Constructive Mathematics"
Sums of products, or products of sums? Neither! | MathFoundations 267 | N J Wildberger
In electrical engineering courses, Boolean functions are described by Boolean expressions, which are however not unique. One approach is to use a sum of products. Another is to look for a product of sums. Going from one to the other is usually onerous. With the Algebra of Boole, neither of
From playlist Boole's Logic and Circuit Analysis
Canonical forms for logic circuits | Math Foundations 263 | N J Wildberger
A key problem in circuit analysis is to associate to a logical circuit, typically made of logic gates such as AND, OR, NOT, XOR, NAND and NOR, an algebraic expression that captures the effect of that circuit on all possible inputs. Such an effect is called a Boolean function, and it acts o
From playlist Boole's Logic and Circuit Analysis
What We've Learned from NKS Chapter 12: The Principle of Computational Equivalence [Part 2]
In this episode of "What We've Learned from NKS", Stephen Wolfram is counting down to the 20th anniversary of A New Kind of Science with [another] chapter retrospective. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or th
From playlist Science and Research Livestreams
Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity - Arkadev Chattopadhyay
Computer Science/Discrete Mathematics Seminar I Topic: Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity Speaker: Arkadev Chattopadhyay Affiliation: Tata Institute of Fundamental Research Date: February 15, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
EEVacademy #2 - Digital Logic Boolean & Demorgan's Theorems
Boolean Algebra & Demorgan's Theorems explained and how they are useful for circuit simplification. EEVblog Main Web Site: http://www.eevblog.com The 2nd EEVblog Channel: http://www.youtube.com/EEVblog2 Support the EEVblog through Patreon! http://www.patreon.com/eevblog EEVblog Amazon
From playlist EEVacademy
Live CEOing Ep 472: Expositions in the Wolfram Language
Join Stephen Wolfram and team for a closer look at using Wolfram Notebooks to create topical expositions... Follow us on our official social media channels. Twitter: https://twitter.com/WolframResearch/ Facebook: https://www.facebook.com/wolframresearch/ Instagram: https://www.instagram.
From playlist Behind the Scenes in Real-Life Software Design
Boolean Logic & Logic Gates: Crash Course Computer Science #3
Today, Carrie Anne is going to take a look at how those transistors we talked about last episode can be used to perform complex actions. With the just two states, on and off, the flow of electricity can be used to perform a number of logical operations, which are guided by a branch of math
From playlist Back to School - Expanded
Live CEOing Ep 29: Calculus Functions in the Wolfram Language
Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Calculus Functions in the Wolfram Language.
From playlist Behind the Scenes in Real-Life Software Design
mod-25 lec-26 Introduction to Fluid Logic
Fundamentals of Industrial Oil Hydraulics and Pneumatics by Prof. R.N. Maiti,Department of Mechanical Engineering,IIT Kharagpur.For more details on NPTEL visit http://nptel.ac.in
From playlist IIT Kharagpur: Fundamentals of Industrial Oil Hydraulics and Pneumatics (CosmoLearning Mechanical Engineering)
Why Algebraic Data Types Are Important
Strong static typing detects a lot of bugs at compile time, so why would anyone prefer to program in JavaScript or Python? The main reason is that type systems can be extremely complex, often with byzantine typing rules (C++ comes to mind). This makes generic programming a truly dark art.
From playlist Functional Programming
Seminar on Applied Geometry and Algebra (SIAM SAGA): Timo de Wolff
Date: Tuesday, March 9 at 11:00am EST (5:00pm CET) Speaker: Timo de Wolff, Technische Universität Braunschweig Title: Certificates of Nonnegativity and Their Applications in Theoretical Computer Science Abstract: Certifying nonnegativity of real, multivariate polynomials is a key proble
From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)
Algebra for Beginners | Basics of Algebra
#Algebra is one of the broad parts of mathematics, together with number theory, geometry and analysis. In its most general form, algebra is the study of mathematical symbols and the rules for manipulating these symbols; it is a unifying thread of almost all of mathematics. Table of Conten
From playlist Linear Algebra