News for hackers. Stuff that matters.
Re:Clearer Conditionals using De Morgan's Laws by batbomb on Friday December 20, 2013 @01:53PM (#6943214)
If you want to get good at clarifying conditionals, take an electronics class and revel in the Karnaugh maps.
Re:Clearer Conditionals using De Morgan's Laws by tsmith on Friday December 20, 2013 @02:13PM (#6943329)
+1

I transferred midway through my undergraduate degree, and was surprised to discover that Karnaugh maps weren't taught at my destination school - they are such an intuitive and straightforward mechanism for whittling down complex logic into its simplest form.

Re:Clearer Conditionals using De Morgan's Laws by RamiK on Friday December 20, 2013 @02:35PM (#6943461)
No need for a full blown electronics class. This subject falls under Switching Theory and can be covered thoroughly in the first (and often a single) semester. Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

There are very few requisites too. Some high schools and trade schools teach the material to 16-18 year-olds in a year or two. I suspect this is partially why it's so often omitted in CS curriculum. It's too easy.

Re:Clearer Conditionals using De Morgan's Laws by dorian-graph on Saturday December 21, 2013 @02:58AM (#6946141)
> Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

Do you happen to have a link to an online course, textbook or other resource that covers this in a combined way that flows to well?

Re:Clearer Conditionals using De Morgan's Laws by mindcrime on Saturday December 21, 2013 @07:05PM (#6948684)
No need for a full blown electronics class. This subject falls under Switching Theory and can be covered thoroughly in the first (and often a single) semester. Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

My Discrete Math 101 course (UNC-Wilmington) covered Karnaugh Maps, along with a heavy dose of Boolean Algebra. For various historical reasons, I've actually taken Discrete Math twice, and have noticed that the content of a class titled such can very dramatically. The other Discrete Math course had much less emphasis on Boolean Algebra and logic, and a lot more on elements of probability and statistics.

Re:Clearer Conditionals using De Morgan's Laws by krisgee on Friday December 20, 2013 @07:15PM (#6945045)
Yeah, K-maps were part of the circuit design course we had to take for our undergrad CS degree.
Re:Clearer Conditionals using De Morgan's Laws by signa11 on Friday December 20, 2013 @07:44PM (#6945145)
yup, zvi-kohavi is a good text...
Re:Clearer Conditionals using De Morgan's Laws by flpgr on Friday December 20, 2013 @05:05PM (#6944393)
I don't think this is necessary. I never wrote a conditional complicated enough to make me even think about getting down to K maps and I believe such a thing would be actually a smell and better be refactored as a whole. Knowing some boolean algebra is nice, though
Re:Clearer Conditionals using De Morgan's Laws by dugmartin on Friday December 20, 2013 @09:00PM (#6945359)
They were covered when I took my first CS math class (discrete math) - I'd imagine they are still part of the standard basic CS core (that was 24 years ago so it might have changed)
Re:Clearer Conditionals using De Morgan's Laws by zerohp on Friday December 20, 2013 @11:36PM (#6945777)
I am at a highly ranked school right now and they are not covered in any CS class. Computer Engineering majors learn them in their introductory course.
Re:Clearer Conditionals using De Morgan's Laws by bcbrown on Friday December 20, 2013 @03:40PM (#6943850)
That was a very painful module to take, but it was incredibly useful.
Re:Clearer Conditionals using De Morgan's Laws by baddox on Friday December 20, 2013 @04:46PM (#6944256)
A digital electronics class, more specifically.
Re:Clearer Conditionals using De Morgan's Laws by nollidge on Friday December 20, 2013 @02:17PM (#6943359)
Always go back to the K-maps.