Part 10

An early and still very popular method of getting data into the computer is the punched card. Jacquard’s clever way of weaving a pattern got into the computer business through Hollerith’s census counting machines. Today the ubiquitous IBM card can do these tasks of nose counting and weaving, and just about everything else in between. Jacquard used the punched holes to permit certain pins to slide through. Hollerith substituted the mercury electrical contact for the loom’s flying needles. Today there are many other ways of “reading” the cards. Metal base plate and springs, star wheels, even photoelectric cells are used to detect the presence or absence of the coded holes. A human who knows the code can visually extract the information; a blind man could do it by the touch system. So with the computer, there are many ways of transferring data.

Remington Rand UNIVAC

The Computer’s Basic Parts. ]

An obvious requirement of the punched card is that someone has to punch the holes in the first place. This is done with manually operated punches, power punches, and even automatic machines that handle more than a hundred cards a minute. Punched cards, which fall into the category called computer “software,” are cheap, flexible, and compatible with many types of equipment.

Particularly with mathematical computations and scientific research, another type of input has become popular, that of paper tape. This in effect strings many cards together and puts them on an easily handled roll. Thus a long series of data can be punched without changing cards, and is conveniently stored for repeated use. Remember the old player-piano rolls of music? These actually formed the input for one kind of computer, a musical machine that converted coded holes to musical sounds by means of pneumatic techniques. Later in this chapter we will discuss some modern pneumatic computers.

More efficient than paper is magnetic tape, the same kind we use in our home recording instruments. Anyone familiar with a tape recorder knows how easy it is to edit or change something on a tape reel. This is a big advantage over punched cards or paper tapes which are physically altered by the data stored on them and cannot be corrected. Besides this, magnetic tape can hold many more “bits” of information than paper and also lends itself to very rapid movement through the reading head of the computer. For example, standard computer tape holds seven tracks, each with hundreds of bits of information per inch. Since there are thousands of feet on a ten-inch reel, it is theoretically possible to pack 40 million bits on this handful of tape!

Since the computer usually can operate at a much higher rate of speed than we can put information onto tape, it is often the practice to have a “buffer” in the input section. This receiving station collects and stores information until it is full, then feeds it to the computer which gobbles it up with lightning speed. Keeping a fast computer continuously busy may require many different inputs.

Never satisfied, computer designers pondered the problem of all the lost time entailed in laboriously preparing cards or tapes for the ravenous electronic machine. The results of this brain-searching are interesting, and they are evident in computers that actually read man-talk. Computers used in the post office and elsewhere can optically read addresses as well as stamps; banks have computers that electrically read the coded magnetic ink numbers on our checks and process thousands of times as many as human workers once did. This optical reading input is not without its problems, of course. Many computers require a special type face to be used, and the post office found that its stamp recognizer was mistaking Christmas seals for foreign stamps. Improved read heads now can read hand-printed material and will one day master our widely differing human scrawls. This is of course a boon to the “programmer” of lengthy equations who now has to translate the whole problem into machine talk before the machine can accept it.

If a machine can read, why can’t it understand verbal input as well? Lazy computer engineers have pushed this idea, and the simplest input system of all is well on the way to success. Computers today can recognize numbers and a few words, and the Japanese have a typewriter that prints out the words spoken to it! These linguistic advances that electronic computers are making are great for everyone, except perhaps the glamorized programmer, a new breed of mathematical logician whose services have been demanded in the last few years.

Magnetic Tape - Paper Tape - IBM Card - Magnetic Ink Characters ]

Control

Before we feed the problem into the machine, or before we give it some “raw” data to process, we had better tell our computer what we want it to do. All the fantastic speed of our electrons will result in a meaningless merry-go-round, or perhaps a glorious machine-stalling short circuit unless the proper switches open and close at the right time. This is the job of the control unit of the computer, a unit that understands commands like “start,” “add,” “subtract,” “find the square root,” “file in Bin B,” “stop,” and so on. The key to all the computer’s parts working together in electronic harmony is its “clock.” This timekeeper in effect snaps its fingers in perfect cadence, and the switches jump at its bidding. Since the finger-snapping takes place at rates of millions of snaps a second, the programmer must be sure he has instructed the computer properly.

The ideal programmer is a rare type with a peculiarly keen brain that sometimes takes seemingly illogical steps to be logical. Programmers are likely to be men—or women, for there is no sex barrier in this new profession—who revel in symbolic logic and heuristic or “hunch” reasoning. Without a program, the computer is an impressively elaborate and frighteningly expensive contraption which cannot tell one number from another. The day may come when the mathematician can say to the machine, “Prove Fermat’s last theorem for me, please,” or the engineer simply wish aloud for a ceramic material that melts at 15,000° C. and weighs slightly less than Styrofoam. Even then the human programmer will not start drawing unemployment insurance, of course. If he is not receiving his Social Security pension by then he will simply shift to more creative work such as thinking up more problems for the machine to solve.

Just as there are many jobs for the computer, so there are many kinds of programs. On a very simple, special-purpose computer, the program may be “wired-in,” or fixed, so that the computer can do that particular job and no other. On a more flexible machine, the program may still be quite simple, perhaps no more than a card entered in a desk unit by an airline ticket agent to let the computer arrange a reservation for three tourist seats on American Airlines jet flight from Phoenix to Chicago at 8:20 A.M. four days from now. On a general-purpose machine, capable of many problems, the program may be unique, a one-of-a-kind highly complex set of instructions that will make the computer tax its huge memory and do all sorts of mental “nip-ups” before it reaches a solution.

A computer that understands about sixty commands has been compared to a Siamese elephant used for teak logging; the animal has about that many words in its vocabulary. Vocabulary is an indication of computer as well as human sophistication. The trend is constantly toward less-than-elephant size, and more-than-elephant vocabulary.

The programmer’s work can be divided into four basic phases: analysis of the problem; application or matching problem requirements with the capabilities of the right computer; flow charting the various operations using symbolic diagrams; and finally, coding or translating the flow chart into language the computer knows.

The flow chart to some extent parallels the way our own brains solve logic problems, or at least the way they ought to solve them. For example, a computer might be instructed to select the smallest of three keys. It would compare A and B, discard the larger, and then compare with C, finally selecting the proper one. This is of course such a ridiculously simple problem that few of us would bother to use the computer since it would take much longer to plot the flow chart than to select the key by simple visual inspection. But the logical principle is the same, even when the computer is to be told to analyze all the business transactions conducted by a large corporation during the year and advise a program for the next year which will show the most profit. From the symbolic flow chart, the programmer makes an operational flow chart, a detailed block diagram, and finally the program itself. Suitably coded in computer language, this program is ready for the computer’s control unit.

With a problem of complex nature, such as one involving the firing of a space vehicle, programmers soon learned they were spending hours, or even days, on a problem which the computer proceeded to zip through in minutes or seconds. It was something like working all year building an elaborate Fourth of July fireworks display, touching the match, and seeing the whole thing go up in spectacular smoke for a brief moment. Of course the end justifies the means in either case, and as soon as the computer has quit whirring, or the skyrockets faded out, the programmer gets back to work. But some short cuts were learned.

Even a program for a unique problem is likely to contain many “subroutines” just like those in other problems. These are used and re-used; some computers now have libraries of programs they can draw on much as we call on things learned last week or last year.

With his work completed, the programmer’s only worry is that an error might exist in it, an error that could raise havoc if not discovered. One false bit of logic in a business problem; a slight mathematical boner in a design for a manned missile, could be catastrophic since our technology is so complicated that the mistake might be learned only when disaster struck. So the programmer checks and rechecks his work until he is positive he has not erred.

How about the computer? It checks itself too; so thoroughly that there is no danger of it making a mistake. Computer designers have been very clever in this respect. One advanced technique is “majority rule” checking. Not long ago when the abacus was used even in banking, the Japanese were aware that a single accountant might make a false move and botch up the day’s tally. But if two operators worked the same problem and got the same answer, the laws of probability rule that the answer can be accepted. If the sums do not agree, though, which man is right? To check further, and save the time needed to go through the whole problem again, three abacuses, or abaci, are put through their paces. Now if two answers agree, chances are they are the right solution. If all three are different, the bank had better hire new clerks!

Remington Rand UNIVAC

A word picture “flow chart” of the logical operation of selecting the proper key. ]

Arithmetic or Logic

Now that our computer has the two necessary ingredients of input and control, the arithmetic or logic unit can get busy. Babbage called this the “mill,” and with all the whirring gears and clanking arms his engine boasted, the term must have been accurate. Today’s computer is much quieter since in electronic switches the only moving parts are the electrons themselves and these don’t make much of a racket. Such switches have another big advantage in that they open and close at a great rate, practically the speed of light. The fastest computers use switches that act in nanoseconds, or billionths of a second. In one nanosecond light itself travels only a foot.

The computer may be likened to someone counting on two of his fingers. Instead of the decimal or ten-base system, most computers use binary arithmetic, which has a base of two. But fingers that can be counted in billionth parts of a second can handle figures pretty fast, and the computer has learned some clever tricks that further speed things up. It can only add, but by adroit juggling it subtracts by using the complement of the desired number, a technique known to those familiar with an ordinary adding machine. There are also some tricks to multiplying that allow the computer again to simply add and come up with the answer.

With pencil and paper we can multiply 117 times 835 easily. Remember, though, that the computer can only add, and that it was once called a speedy imbecile. The most imbecilic computer might solve the problem by adding 117 to itself 835 times. A smarter model will reverse the procedure and handle only 117 numbers. The moron type of computer is a bit more clever and sets up the problem this way:

835 835 835 835 835 835 835 8350 83500 —— 97695