Steve Vinoski on the different RPC(-esque) systems :
The layers of complexity required to maintain the resulting leaky illusion of local/remote transparency are reminiscent of the convoluted equations that pre-copernican astronomers used to explain how the sun and other planets moved around the earth.
(from some recent IEEE Internet Computing Issue)
Roy Fielding: “All links are wishful thinking. Guessed links are just somewhat more wishful than others.”
From the latest release notes
The Linux version of TrueCrypt has been redesigned so that it will no longer be affected by changes to the Linux kernel (kernel upgrades/updates).
Oh thank you! Atlast!
This is just beautiful. Has to be seen to be believed. (firefox and safari only).
(from CSS-Tricks)
A friend introduced me to Graham’s number recently. It is the largest number every used, i.e the largest named number. I went to read it up at Wikipedia :
…too large to be written in scientific notation because even the digits in the exponent would exceed the number of atoms in the observable universe
….
Graham’s number is connected to the following problem in the branch of mathematics known as Ramsey theory:
….Although the solution to this problem is not yet known, Graham’s number is the smallest known upper bound for it. This bound was found by Graham and B. L. Rothschild (see (GR), corollary 12). They also provided the lower bound 6, adding the qualifying understatement: “Clearly, there is some room for improvement here.”
Clearly!
