Hunting Elephants

Thanks to Meredith Hoffman for finding this one!

This only includes the Mathematician/Computer Scientist/Engineer portion here. The complete list can be read here:

MATHEMATICIANS hunt elephants by going to Africa, throwing out everything that is not an elephant, and catching one of whatever is left.

EXPERIENCED MATHEMATICIANS will attempt to prove the existence of at least one unique elephant before proceeding to step 1 as a subordinate exercise.

PROFESSORS OF MATHEMATICS will prove the existence of at least one unique elephant and then leave the detection and capture of an actual elephant as an exercise for their graduate students.

COMPUTER SCIENTISTS hunt elephants by exercising Algorithm A:

  1. Go to Africa.
  2. Start at the Cape of Good hope.
  3. Work northward in an orderly manner, traversing the continent alternately east and west.
  4. During each traverse pass,
    1. Catch each animal seen.
    2. Compare each animal caught to a known elephant.
    3. Stop when a match is detected.

EXPERIENCED COMPUTER PROGRAMMERS modify Algorithm A by placing a known elephant in Cairo to ensure that the algorithm will terminate.

ASSEMBLY LANGUAGE PROGRAMMERS prefer to execute Algorithm A on their hands and knees.

DATABASE ADMINISTRATORS do not need to go out and capture elephants when they can retrieve them simply with an ad hoc query:

   3 AND SIZE = 'LARGE' 
   4 AND COLOR = 'GRAY' 
   5 AND TRUNK ='YES' 

ENGINEERS hunt elephants by going to Africa, catching gray animals at random, and stopping when any one of them weighs within plus or minus 15 percent of any previously observed elephant.

SYSTEMS INTEGRATION ENGINEERS are not so concerned with hunting elephants as with creating a seamless interface between the elephants and their environment.

Print Friendly, PDF & Email