Page:Passages from the Life of a Philosopher.djvu/142

126 condition (a), or the unlimited number of digits contained in each constant employed, is fulfilled.

It must, however, be admitted that this advantage is gained at the expense of diminishing the number of the constants the Engine can hold. An engine of fifty digits, when used as one of a hundred digits, can only contain half the number of variables. An engine containing $$m$$ columns, each holding $$n$$ digits, if used for computations requiring $$kn$$ digits, can only hold $$\frac{m}{k}$$ constants or variables.

(b). The next step is therefore to prove (b), viz.: to show that a finite engine can be used as if it contained an unlimited number of constants. The method of punching cards for tabular numbers has already been alluded to. Each Analytical Engine will contain one or more apparatus for printing any numbers put into it, and also an apparatus for punching on pasteboard cards the holes corresponding to those numbers. At another part of the machine a series of number cards, resembling those of Jacquard, but delivered to and computed by the machine itself, can be placed. These can be called for by the Engine itself in any order in which they may be placed, or according to any law the Engine may be directed to use. Hence the condition (b) is fulfilled, namely: an unlimited number of constants can be inserted in the machine in an unlimited time.

I propose in the Engine I am constructing to have places for only a thousand constants, because I think it will be more than sufficient. But if it were required to have ten, or even a hundred times that number, it would be quite possible to make it, such is the simplicity of its structure of that portion of the Engine.

(c). The next stage in the arithmetic is the number of times