Posts by Category

Closures

ListComprehension

boolean_algebra

CDNF Part II: Take the namedtuples bowling

27 minute read

Reducing from Normal Form The basics of reducing is that you need two terms like ABC and ABC’. This can be reduced to AB(C + C’). In Logic (C + C’) evaluates...

CDNF Part I: Canonical Fodder

11 minute read

Canonical Normal Forms and Minimization Quite a while ago I read parts of Randy Hyde’s The Art of Assembly Language Programming (AoA). The section on boolean...

logic

CDNF Part II: Take the namedtuples bowling

27 minute read

Reducing from Normal Form The basics of reducing is that you need two terms like ABC and ABC’. This can be reduced to AB(C + C’). In Logic (C + C’) evaluates...

CDNF Part I: Canonical Fodder

11 minute read

Canonical Normal Forms and Minimization Quite a while ago I read parts of Randy Hyde’s The Art of Assembly Language Programming (AoA). The section on boolean...

namedtuple

CDNF Part II: Take the namedtuples bowling

27 minute read

Reducing from Normal Form The basics of reducing is that you need two terms like ABC and ABC’. This can be reduced to AB(C + C’). In Logic (C + C’) evaluates...

CDNF Part I: Canonical Fodder

11 minute read

Canonical Normal Forms and Minimization Quite a while ago I read parts of Randy Hyde’s The Art of Assembly Language Programming (AoA). The section on boolean...

python

CDNF Part II: Take the namedtuples bowling

27 minute read

Reducing from Normal Form The basics of reducing is that you need two terms like ABC and ABC’. This can be reduced to AB(C + C’). In Logic (C + C’) evaluates...

CDNF Part I: Canonical Fodder

11 minute read

Canonical Normal Forms and Minimization Quite a while ago I read parts of Randy Hyde’s The Art of Assembly Language Programming (AoA). The section on boolean...

setup