fortune.md

Entropia: amnésia termodinâmica.
The temperature of Heaven can be rather accurately computed from available
data.  Our authority is Isaiah 30:26, "Moreover, the light of the Moon
shall be as the light of the Sun and the light of the Sun shall be
sevenfold, as the light of seven days."  Thus Heaven receives from the Moon as much
radiation as we do from the Sun, and in addition seven times seven (49)
times as much as the Earth does from the Sun, or fifty times in all.  The light
we receive from the Moon is one ten-thousandth of the light we receive from
the Sun, so we can ignore that.  With these data we can compute the
temperature of Heaven.  The radiation falling on Heaven will heat it to the point
where the heat lost by radiation is just equal to the heat received by
radiation, i.e., Heaven loses fifty times as much heat as the Earth by radiation.
Using the Stefan-Boltzmann law for radiation, (H/E)^4 = 50, where E is the
absolute temperature of the earth (-300K), gives H as 798K (525C).  The exact
temperature of Hell cannot be computed, but it must be less than 444.6C,
the temperature at which brimstone or sulphur changes from a liquid to a gas.
Revelations 21:8 says "But the fearful, and unbelieving ... shall have
their part in the lake which burneth with fire and brimstone."  A lake of molten
brimstone means that its temperature must be at or below the boiling
point, or 444.6C  (Above this point it would be a vapor, not a lake.)  We have,
then, that Heaven, at 525C is hotter than Hell at 445C.
                -- "Applied Optics", vol. 11, A14, 1972
Lemma:  All horses are the same color.
Proof (by induction):
        Case n = 1: In a set with only one horse, it is obvious that all
        horses in that set are the same color.
        Case n = k: Suppose you have a set of k+1 horses.  Pull one of these
        horses out of the set, so that you have k horses.  Suppose that all
        of these horses are the same color.  Now put back the horse that you
        took out, and pull out a different one.  Suppose that all of the k
        horses now in the set are the same color.  Then the set of k+1 horses
        are all the same color.  We have k true => k+1 true; therefore all
        horses are the same color.

Theorem: All horses have an infinite number of legs.
Proof (by intimidation):
        Everyone would agree that all horses have an even number of legs.
        It is also well-known that horses have forelegs in front and two legs
        in back.  4 + 2 = 6 legs, which is certainly an odd number of legs
        for a horse to have!  Now the only number that is both even and odd is
        infinity; therefore all horses have an infinite number of legs.
        However, suppose that there is a horse somewhere that does not
        have an infinite number of legs.  Well, that would be a horse of a
        different color; and by the Lemma, it doesn't exist.
                 ___          ______
                /__/\     ___/_____/\          FrobTech, Inc.
                \  \ \   /         /\\
                 \  \ \_/__       /  \         "If you've got the job,
                 _\  \ \  /\_____/___ \         we've got the frob."
                // \__\/ /  \       /\ \
        _______//_______/    \     / _\/______
       /      / \       \    /    / /        /\
    __/      /   \       \  /    / /        / _\__
   / /      /     \_______\/    / /        / /   /\
  /_/______/___________________/ /________/ /___/  \
  \ \      \    ___________    \ \        \ \   \  /
   \_\      \  /          /\    \ \        \ \___\/
      \      \/          /  \    \ \        \  /
       \_____/          /    \    \ \________\/
            /__________/      \    \  /
            \   _____  \      /_____\/
             \ /    /\  \    / \  \ \
              /____/  \  \  /   \  \ \
              \    \  /___\/     \  \ \
               \____\/            \__\/
The only "intuitive" interface is the nipple.  After that, it's all
learned.
        -- Bruce Ediger, bediger@teal.csn.org, on X interfaces
"We invented a new protocol and called it Kermit, after Kermit the Frog,
star of "The Muppet Show." [3]

[3]  Why?  Mostly because there was a Muppets calendar on the wall when we
were trying to think of a name, and Kermit is a pleasant, unassuming sort
of character.  But since we weren't sure whether it was OK to name our
protocol after this popular television and movie star, we pretended that
KERMIT was an acronym; unfortunately, we could never find a good set of
words to go with the letters, as readers of some of our early source code
can attest.  Later, while looking through a name book for his forthcoming
baby, Bill Catchings noticed that "Kermit" was a Celtic word for "free",
which is what all Kermit programs should be, and words to this effect
replaced the strained acronyms in our source code (Bill's baby turned out
to be a girl, so he had to name her Becky instead).  When BYTE Magazine
was preparing our 1984 Kermit article for publication, they suggested we
contact Henson Associates Inc. for permission to say that we did indeed
name the protocol after Kermit the Frog. Permission was kindly granted,
and now the real story can be told.  I resisted the temptation, however,
to call the present work "Kermit the Book."
                -- Frank da Cruz, "Kermit - A File Transfer Protocol"
        After sifting through the overwritten remaining blocks of Luke's home
directory, Luke and PDP-1 sped away from /u/lars, across the surface of the
Winchester riding Luke's flying read/write head.  PDP-1 had Luke stop at the
edge of the cylinder overlooking /usr/spool/uucp.
        "Unix-to-Unix Copy Program;" said PDP-1.  "You will never find a more
wretched hive of bugs and flamers.  We must be cautious."
                -- DECWARS
Só que o erro maior é justamente ficar procurando os erros...
Ou, citando Casa das Máquinas:
"Certo sim, seu errado, certo sim, seu errado...."