Boole Reduction: A challenge for programmers
72.6K subscribers
SUBSCRIBED
Moving from Boolean algebra to the more powerful and direct Algebra of Boole for circuit analysis opens up some unique challenges for programmers. This will be especially relevant for those with interest and experience in Maple, Mathematica, Matlab, Sage, Mupad and other Computer Algebra Systems. We need good programs that will implement Boole reduction of polynomials to obtain the canonical Boole polynumbers for general expressions in the Algebra of Boole. In this video we explain what is needed at several different levels. The challenge also extends to simplification routines in more general software languages. In addition, we want to think about creating SAT solvers in the Algebra of Boole context, that take a big Algebra of Boole expression, and try to determine whether or not the result is zero, without actually evaluating it. There is much to do here! The entire content on Boole's Logic and Circuit Analysis is now in a separate Playlist at https://www.youtube.com/playlist?list.... If you value this content, and would like to support my efforts at re-organizing mathematics research and education, please consider becoming a Patron of my channel at https://www.patreon.com/njwildberger. Your contribution will help me move forward to provide more great material, and you will be able to participate in the Boole's Logic and Circuit Analysis online course which will be starting later next year! Very exciting...