Скачать или смотреть Explain Combinatorial Thinking Like I'm 5 | Computer Science Logic Part 1

Sign up for DUTC Weekly: https://mailchi.mp/dutc/ytweekly

LinkedIn:   / dont-use-this-code  
Website: https://www.dontusethiscode.com/
Upcoming events: learning.dutc.io
Looking for training? Contact [email protected]

Abstract
In this bonus session, we discuss topics drawn from symbolic, propositional, and binary logic and see how they apply to actual problems in our work.

We look to answer the following questions:
• What are the basics of combinatoric thinking? How do these appear in the itertools module?
• What are the core rules of propositional logic? What are the deductive argument forms and rules of inference?
• What is DeMorgan’s Law? What is a truth table? What is boolean simplification? What is a Karnaugh map? What are CDNF and CCNF (“sum of products”/“products of sums”)?
• What is NAND-completeness? What is the enumeration of all possible boolean functions?
• What is the relationship between gate-level modeling, binary logic, and set operations?

Series Overview
You don’t need a Computer Science degree to be a good programmer. In fact, some of the best programmers out there are folks with no formal CS training!

But this doesn’t mean that the knowledge and the topics covered in a CS degree are not useful. In fact, your typical Computer Science degree covers quite a bit of theory that is useful and applicable to common programming tasks.

Are you looking to build a stronger foundational theoretical understanding of computing?
Are you looking for a condensed view of some of the major topics that would be covered in a CS degree?
Are you looking for hands-on application of these topics to concrete programming problems?
… if so, then you’re going to want to join us for this three-part seminar series!

Lesson plan
In our first session in the series, Algorithms & Complexity, we started from a theoretical approach to computational complexity and show how this has practical implications to everyday code-level design and implementation.
In our second session, Graphs (but no Charts), we looked at tree and graph theory and saw how these provide a framework for solving a variety of common problems.
In this bonus session, "Logic", we review the topics of symbolic, propositional, binary/boolean logic, and see how we can apply these to better reason about our code.
In our third session, Dynamic Programming, we will take a look at the most useless new hire interview question and see if, lurking behind all the jargon and theory, there is something interesting, useful and exciting to be found.