- That's the best I've felt about a Theory test in a while. Hooray :)
- It turns out that the problem of checking whether two boolean formulas are not equal is NP-Complete. Solve that, and you can totally solve satisfiability in general. Ho! (proof idea: "satisfiable" means the same thing as "not logically equivalent to a contradiction")
- It turns out that the problem of checking whether two boolean formulas are not equal is NP-Complete. Solve that, and you can totally solve satisfiability in general. Ho! (proof idea: "satisfiable" means the same thing as "not logically equivalent to a contradiction")