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
From playlist Week 1 2015 Shorts
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
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
Replacing truth tables and Boolean equivalences | MathFoundations274 | N J Wildberger
While Propositional Logic is a branch of philosophy, concerned with systematizing reasoning using connectives such as AND, OR, NOT, IMPLIES and EQUIVALENT, the Algebra of Boole provides a mathematical framework for modelling some of this. With this approach we ignore the issue of the mean
From playlist Boole's Logic and Circuit Analysis
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
Analysis of Boolean Functions on Association Schemes - Yuval Filmus
Yuval Filmus Member, School of Mathematics September 23, 2014 More videos on http://video.ias.edu
From playlist Mathematics
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
Monadic Parsers at the Input Boundary
When reading a byte stream over the process I/O boundary, the first thing which everyone should do is to parse the byte stream with a monadic parser. The talk will discuss Processes and input byte streams. Monadic parsers. What they are and why they matter. The design and use of the pure
From playlist Functional Programming
The Algebra of Boole is not Boolean Algebra! (I) | Math Foundations 255 | N J Wildberger
We begin to introduce the Algebra of Boole, starting with the bifield of two elements, namely {0,1}, and using that to build the algebra of n-tuples, which is a linear space over the bifield with an additional multiplicative structure. This important abstract development played a key role
From playlist Boole's Logic and Circuit Analysis
Diego Figueira: Semistructured data, Logic, and Automata – lecture 2
Semistructured data is an umbrella term encompassing data models which are not logically organized in tables (i.e., the relational data model) but rather in hierarchical structures using markers such as tags to separate semantic elements and data fields in a ‘self-describing’ way. In this
From playlist Logic and Foundations
LambdaConf 2015 - Programs as Values Pure Composable Database Access in Scala Rob Norris
FP is often glibly described as "programming with functions", but we can equivalently say that FP is about programming with values. Functions are values, failures are values, effects are values, and indeed programs themselves can be treated as values. This talk explores some consequences o
From playlist LambdaConf 2015
Ian talks about leveraging algebraic theory in JavaScript to create functional, structured code that is simple to test and demonstrates algebraic traits. EVENT: Vancouver Full Stack, 2019-09-17 SPEAKER: Ian Hofmann-Hicks PUBLICATION PERMISSIONS: Original video was published with the
From playlist JavaScript
LambdaConf 2015 - Finally Tagless DSLs and MTL Joseph Abrahamson
Finally Tagless DSLs are a DSL embedding technique pioneered by Oleg Kiselyov, Jaques Carrette, and Chung-Chieh Shan that is in some sense "dual" to the notions of free-monad interpreters. MTL is a very popular monad library in Haskell which just so happens to be, unbeknownst to most, a Fi
From playlist LambdaConf 2015
Part 9 of the APL study group. Details here: https://forums.fast.ai/t/apl-array-programming/97188 Discuss this session here: https://forums.fast.ai/t/fast-ai-apl-study-session-9/97510
From playlist fast.ai APL Study Group
PROG2006: Haskell - state - part 2/2
PROG2006 Advanced Programming Haskell, handling state. State monad, StateT. Briefly about Reader and Writer (ReaderT and WriterT).
From playlist PROG2006 - Programming
PROG2006 Advanced Programming Haskell - state, introduction Identity element Associative, Commutative operations Functor
From playlist PROG2006 - Programming
Linear Algebra: Continuing with function properties of linear transformations, we recall the definition of an onto function and give a rule for onto linear transformations.
From playlist MathDoctorBob: Linear Algebra I: From Linear Equations to Eigenspaces | CosmoLearning.org Mathematics