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:
- Microsoft’s character picker is totally useless
- Whoever thought of securing official Unicode character charts against copying to clipboard must be braindamaged