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

From Wikisource
Jump to navigation Jump to search
This page has been validated.
128
A FINITE MACHINE MAY

For the sake of uniformity, I have used with as many indices as may be required throughout the Engine. This however, does not prevent the printed result of a development from being represented by any letters which may be thought to be more convenient. In that part in which the results are printed, type of any form may be used, according to the taste of the proposer of the question.

It thus appears that the two conditions, (e) and (f), which require that the number of constants and of variables should be unlimited, are both fulfilled.

The condition (g) requiring that the number of combinations of the four algebraic signs shall be unlimited, is easily fulfilled by placing them on cards in any order of succession the problem may require.

The last condition (h), namely, that the number of functions to be employed must be without limit, might seem at first sight to be difficult to fulfil. But when it is considered that any function of any number of operations performed upon any variables is but a combination of the four simple signs of operation with various quantities, it becomes apparent that any function whatever may be represented by two groups of cards, the first being signs of operation, placed in the order in which they succeed each other, and the second group of cards representing the variables and constants placed in the order of succession in which they are acted upon by the former.

Thus it appears that the whole of the conditions which enable a finite machine to make calculations of unlimited extent are fulfilled in the Analytical Engine. The means I have adopted are uniform. I have converted the infinity of space, which was required by the conditions of the problem, into the infinity of time. The means I have employed are in