Linux Computers

Say "twenty-three-skiddoo" to logout.

SCCS, the source motel!  Programs check in and never check out!
                -- Ken Thompson

Science is to computer science as hydrodynamics is to plumbing.

Scientists were preparing an experiment to ask the ultimate question.
They had worked for months gathering one each of every computer that was
built. Finally the big day was at hand.  All the computers were linked
together.  They asked the question, "Is there a God?".  Lights started
blinking, flashing and blinking some more.  Suddenly, there was a loud
crash, and a bolt of lightning came down from the sky, struck the
computers, and welded all the connections permanently together.  "There
is now", came the reply.

Scotty: Captain, we din' can reference it!
Kirk:   Analysis, Mr. Spock?
Spock:  Captain, it doesn't appear in the symbol table.
Kirk:   Then it's of external origin?
Spock:  Affirmative.
Kirk:   Mr. Sulu, go to pass two.
Sulu:   Aye aye, sir, going to pass two.

"Section 2.4.3.5   AWNS   (Acceptor Wait for New Cycle State).
        In AWNS the AH function indicates that it has received a
multiline message byte.
        In AWNS the RFD message must be sent false and the DAC message
must be sent passive true.
        The AH function must exit the AWNS and enter:
        (1)  The ANRS if DAV is false
        (2)  The AIDS if the ATN message is false and neither:
                (a)  The LADS is active
                (b)  Nor LACS is active"

                -- from the IEEE Standard Digital Interface for
                   Programmable Instrumentation

Security check: INTRUDER ALERT!

Seems a computer engineer, a systems analyst, and a programmer were
driving down a mountain when the brakes gave out.  They screamed down the
mountain, gaining speed, but finally managed to grind to a halt, more by
luck than anything else, just inches from a thousand foot drop to jagged
rocks.  They all got out of the car:
        The computer engineer said, "I think I can fix it."
        The systems analyst said, "No, no, I think we should take it
into town and have a specialist look at it."
        The programmer said, "OK, but first I think we should get back
in and see if it does it again."

                                SEMINAR ANNOUNCEMENT

Title:          Are Frogs Turing Compatible?
Speaker:        Don "The Lion" Knuth

                                ABSTRACT
        Several researchers at the University of Louisiana have been studying
the computing power of various amphibians, frogs in particular.  The problem
of frog computability has become a critical issue that ranges across all areas
of computer science.  It has been shown that anything computable by an amphi-
bian community in a fixed-size pond is computable by a frog in the same-size
pond -- that is to say, frogs are Pond-space complete.  We will show that
there is a log-space, polywog-time reduction from any Turing machine program
to a frog.  We will suggest these represent a proper subset of frog-computable
functions.
        This is not just a let's-see-how-far-those-frogs-can-jump seminar.
This is only for hardcore amphibian-computation people and their colleagues.
        Refreshments will be served.  Music will be played.

Send some filthy mail.