Archive for March, 2009

Is this true?

So this thing on Wikipedia

http://en.wikipedia.org/wiki/Noisy-channel_coding_theorem

could have left it at the classical statement of the theorem with bullet #1. Then it goes on to say:

2. If a probability of bit error \(p_b\) is acceptable, rates up to \(R(p_b)\) are achievable, where

\(R(p_b) = \frac{C}{1-H_2(p_b)}\).

3. For any \(p_b\), rates greater than \(R(p_b)\) are not achievable.
(Read the article)

Hitchens vs. Hitchens

In some roundabout way I came across the debate of Christopher Hitchens vs. Peter Hitchens on youtube. If you search for it on Google you will find it.

These two are fairly quick on their feet, but almost opposite in style. Peter is more fair and circumspect yet outgunned at times, while Christopher is sharper and wittier yet full of bluster.
(Read the article)

« Previous Page