-
Recent Posts
Archives
- June 2018
- October 2017
- September 2017
- June 2017
- January 2017
- December 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
Categories
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
Comments Off on From a contradiction you can prove anything
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)
Comments Off on Huffman codes, language, and mythical creatures