|
Linux Computers
Fortune: 640 - 649 of 1023 from Linux Computers
Linux Computers: 640 of 1023 |
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.
| | | Linux Computers: 641 of 1023 |
"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
| | | Linux Computers: 642 of 1023 |
Security check: INTRUDER ALERT!
| | | Linux Computers: 643 of 1023 |
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."
| | | Linux Computers: 644 of 1023 |
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.
| | | Linux Computers: 645 of 1023 |
Send some filthy mail.
| | | Linux Computers: 646 of 1023 |
Sendmail may be safely run set-user-id to root.
-- Eric Allman, "Sendmail Installation Guide"
| | | Linux Computers: 647 of 1023 |
Several students were asked to prove that all odd integers are prime.
The first student to try to do this was a math student. "Hmmm...
Well, 1 is prime, 3 is prime, 5 is prime, and by induction, we have that all
the odd integers are prime."
The second student to try was a man of physics who commented, "I'm not
sure of the validity of your proof, but I think I'll try to prove it by
experiment." He continues, "Well, 1 is prime, 3 is prime, 5 is prime, 7 is
prime, 9 is... uh, 9 is... uh, 9 is an experimental error, 11 is prime, 13
is prime... Well, it seems that you're right."
The third student to try it was the engineering student, who responded,
"Well, to be honest, actually, I'm not sure of your answer either. Let's
see... 1 is prime, 3 is prime, 5 is prime, 7 is prime, 9 is... uh, 9 is...
well, if you approximate, 9 is prime, 11 is prime, 13 is prime... Well, it
does seem right."
Not to be outdone, the computer science student comes along and says
"Well, you two sort've got the right idea, but you'll end up taking too long!
I've just whipped up a program to REALLY go and prove it." He goes over to
his terminal and runs his program. Reading the output on the screen he says,
"1 is prime, 1 is prime, 1 is prime, 1 is prime..."
| | | Linux Computers: 648 of 1023 |
She sells cshs by the cshore.
| | | Linux Computers: 649 of 1023 |
Shopping at this grody little computer store at the Galleria for a
totally awwwesome Apple. Fer suuure. I mean Apples are nice you know?
But, you know, there is this cute guy who works there and HE says that
VAX's are cooler! I mean I don't really know, you know? He says that he
has this totally tubular VAX at home and it's stuffed with memory-to-the-max!
Right, yeah. And he wants to take me home to show it to me. Oh My God!
I'm suuure. Gag me with a Prime!
| |
|
|