19 Oct 2005 mathrick   » (Journeyer)

Everyday maths

Let A be class of IDE disks, a be element of A such that a is my disk, D be the class of USB devices and F:A -> D be the mapping (“USB2.0 IDE disk case”). Show whether for every x in X (set of machines running WinXP) the following predicate P is true:

P(x) = F(a) plugged into x fucks the network connection n

Discuss the hypothesis H0 that F(a) and n (set of network connections) are independent values (so called No Fucking Way paradox).

Note: The following lemmas can be useful:

  1. Microsoft’s character picker is totally useless
  2. Whoever thought of securing official Unicode character charts against copying to clipboard must be braindamaged


Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!