But here a difficulty arises: successive powers of ten are to be substituted for x in the equation, until a certain event happens. A set of cards may be provided to make the substitution of the highest power of ten, and similarly for the others; but on the occurrence of a certain event, namely, the change of a sign from + to – , this stage of the calculation is to terminate.
Now at a very early period of the inquiry I had found it necessary to teach the engine to know when any numbers it might be computing passed through zero or infinity.
The passage through zero can be easily ascertained, thus: Let the continually-decreasing number which is being computed be placed upon a column of wheels in connection with a carrying apparatus. After each process this number will be diminished, until at last a number is subtracted from it which is greater than the number expressed on those wheels.
| Thus let it be | 00000,00000,00000,00423 |
| Subtract | 00000,00000,00000,00511 |
| 99999,99999,99999,99912 |
Now in every case of a carriage becoming due, a certain lever is transferred from one position to another in the cage next above it.
Consequently in the highest cage of all (say the fiftieth in the Analytical Engine), an arm will be moved or not moved accordingly as the carriages do or do not run up beyond the highest wheel.
This aim can, of course, make any change which has previously been decided upon. In the instance we have been considering it would order the cards to be turned on to the next set.
If we wish to find when any number, which is increasing,
