References from last night’s meeting

[Tom Stuart]

Photos: https://www.flickr.com/photos/tomstuart/sets/72157649134569472/

Ruby code:

def NAND(a, b)

  !(a && b)

end

def NOT(a)

  NAND(a, a)

end

def AND(a, b)

  NOT(NAND(a, b))

end

def OR(a, b)

  NAND(NOT(a), NOT(b))

end

def XOR(a, b)

  AND(OR(a, b), NAND(a, b))

end

def MUX(a, b, sel)

  OR(AND(NOT(sel), a), AND(sel, b))

end

Wikipedia pages:

• De Morgan’s Laws: http://en.wikipedia.org/wiki/De_Morgan's_laws
• Disjunctive normal form: http://en.wikipedia.org/wiki/Disjunctive_normal_form
• Circuit minimisation for Boolean functions: http://en.wikipedia.org/wiki/Circuit_minimization_for_Boolean_functions
• Karnaugh map: http://en.wikipedia.org/wiki/Karnaugh_map
• Quine–McCluskey algorithm: http://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm

Cheers,

-Tom