Any calculating machine has a _mentality_, consisting of the whole collection of different ideas that the machine can ever actually express in one way or another. For example, a 10-place desk calculating machine can handle numbers up to 10 decimal digits without additional capacity. It cannot handle bigger numbers. [Illustration: FIG. 2. Four directions.] What are the 4 _operations with numbers_ which Simon can carry out? Let us consider some simple operations that we can perform with just 4 numbers. Suppose that they stood for 4 directions in the order east, north, west, south (see Fig. 2). Or suppose that they stood for a turn counterclockwise through some right angles as follows: 0: Turn through 0°, or no right angles. 1: Turn through 90°, or 1 right angle. 2: Turn through 180°, or 2 right angles. 3: Turn through 270°, or 3 right angles. Then we could have the operations of _addition_ and _negation_, defined as follows: ADDITION NEGATION _c_ = _a_ + _b_ _c_ = -_a_ _b_: 0 1 2 3 _a_|_c_ _a_ +————————— ————+———— 0 | 0 1 2 3 0 | 0 1 | 1 2 3 0 1 | 3 2 | 2 3 0 1 2 | 2 3 | 3 0 1 2 3 | 1 For example, the first table says, “1 plus 3 equals 0.” This means that, if we turn 1 right angle and then turn in the same direction 3 more right angles, we face in exactly the same way as we did at the start. This statement is clearly true. For another example, the second table says, “2 is the negative of 2.” This means that, if we turn to the left 2 right angles, we face in exactly the same way as if we turn to the right 2 right angles, and this statement also is, of course, true. With only these two operations in Simon, we should probably find him a little too dull to tell us much. Let us, therefore, put into Simon two more operations. Let us choose two operations involving both numbers and logic: in particular, (1) finding which of two numbers is greater and (2) selecting. In this way we shall make Simon a little cleverer. It is easy to teach Simon how to find which of two numbers is the greater when all the numbers that Simon has to know are 0, 1, 2, 3. We put all possible cases of two numbers _a_ and _b_ into a table: _b_: 0 1 2 3 _a_+————————— 0 | 1 | 2 | 3 | Then we tell Simon that we shall mark with 1 the cases where _a_ is greater than _b_ and mark with 0 the cases where _a_ is not greater than _b_: GREATER THAN _b_: 0 1 2 3 _a_+————————— 0 | 0 0 0 0 1 | 1 0 0 0 2 | 1 1 0 0 3 | 1 1 1 0 For example, “2 is greater than 3” is false, so we put 0 in the table on the 2 line in the 3 column. We see that, for the 16 possible cases, _a_ is greater than _b_ in 6 cases and _a_ is not greater than _b_ in 10 cases.