Monthly Archives: February 2016

From a contradiction you can prove anything

Premise: 0. P ∧ P’ Theorem 1. P (simplification from 0) 2. P’ (simplification from 0) 3. P ∨ M (addition from 1) 4. M (disjunctive syllogism from 2 and 3) Q.E.D. Or in words: P and not P are … Continue reading

Posted in Logic, Rationality

Huffman codes, language, and mythical creatures

Let’s say you’re a telegraph operator, and you can send bits of 0 or 1 down the line one at a time. Each bit has a cost associated with it; the longer the message the more you have to pay. To … Continue reading

Posted in Mathematics, Science (general)