Название: Writings of Charles S. Peirce: A Chronological Edition, Volume 6
Автор: Charles S. Peirce
Издательство: Ingram
Жанр: Языкознание
isbn: 9780253016690
isbn:
One peculiarity of both these machines is that while they perform the inference from (A + B)C to AC + BC, they will not perform the converse inference from AC + BC to (A + B)C. This is curious, because the inference they refuse to perform seems to be merely syllogistic, while the one they do perform, and in fact continually insist on performing, whether it is wanted or not, is dilemmatic, and therefore essentially more complicated. But in point of fact neither of the machines really gives the conclusion of a pair of syllogistic premises; it merely presents a list of all the possible species in the universe, and leaves us to pick out the syllogistic conclusions for ourselves. Thus, with Marquand’s machine, we enter the premise All A is B in the form a + B, and the premise All B is C in the form b + C; but instead of finding the conclusion in the form a + C, it appears as—
As we only want a description of A, we multiply by that letter, and so reduce the conclusion to ABCD + ABCd, but there is no elimination of the B nor of the D. We do not even get the full conclusion in the form ab + BC, although it is one of the advantages of Marquand’s machine that it does give the conclusion, not only in the form just cited, but also, simultaneously, as
The secret of all reasoning machines is after all very simple. It is that whatever relation among the objects reasoned about is destined to be the hinge of a ratiocination, that same general relation must be capable of being introduced between certain parts of the machine. For example, if we want to make a machine which shall be capable of reasoning in the syllogism
we have only to have a connection which can be introduced at will, such that when one event A occurs in the machine, another event B must also occur. This connection being introduced between A and B, and also between B and C, it is necessarily virtually introduced between A and C. This is the same principle which lies at the foundation of every logical algebra; only in the algebra, instead of depending directly on the laws of nature, we establish conventional rules for the relations used. When we perform a reasoning in our unaided minds we do substantially the same thing, that is to say, we construct an image in our fancy under certain general conditions, and observe the result. In this point of view, too, every machine is a reasoning machine, in so much as there are certain relations between its parts, which relations involve other relations that were not expressly intended. A piece of apparatus for performing a physical or chemical experiment is also a reasoning machine, with this difference, that it does not depend on the laws of the human mind, but on the objective reason embodied in the laws of nature. Accordingly, it is no figure of speech to say that the alembics and cucurbits of the chemist are instruments of thought, or logical machines.
Every reasoning machine, that is to say, every machine, has two inherent impotencies. In the first place, it is destitute of all originality, of all initiative. It cannot find its own problems; it cannot feed itself. It cannot direct itself between different possible procedures. For example, the simplest proposition of projective geometry, about the ten straight lines in a plane, is proved by von Staudt from a few premises and by reasoning of extreme simplicity, but so complicated is the mode of compounding these premises and forms of inference, that there are no less than 70 or 80 steps in the demonstration. How could we make a machine which would automatically thread its way through such a labyrinth as that? And even if we did succeed in doing so, it would still remain true that the machine would be utterly devoid of original initiative, and would only do the special kind of thing it had been calculated to do. This, however, is no defect in a machine; we do not want it to do its own business, but ours. The difficulty with the balloon, for instance, is that it has too much initiative, that it is not mechanical enough. We no more want an original machine, than a house-builder would want an original journeyman, or an American board of college trustees would hire an original professor. If, however, we will not surrender to the machine, the whole business of initiative is still thrown upon the mind; and this is the principal labor.
In the second place, the capacity of a machine has absolute limitations; it has been contrived to do a certain thing, and it can do nothing else. For instance, the logical machines that have thus far been devised can deal with but a limited number of different letters. The unaided mind is also limited in this as in other respects; but the mind working with a pencil and plenty of paper has no such limitation. It presses on and on, and whatever limits can be assigned to its capacity today, may be over-stepped tomorrow. This is what makes algebra the best of all instruments of thought; nothing is too complicated for it. And this great power it owes, above all, to one kind of symbol, the importance of which is frequently entirely overlooked—I mean the parenthesis. We can, of course, dispense with parentheses as such. Instead of (a + b)c = d, we can write a + b = t and tc = d. The letter t is here a transmogrified parenthesis. We see that the power of adding proposition to proposition is in some sort equivalent to the use of a parenthesis.
Mr. Marquand’s machines, even with only four letters, facilitate the treatment of problems in more letters, while still leaving considerable for the mind to do unaided. It is very desirable a machine on the same principle should be constructed with six letters. It would be a little more elegant, perhaps, instead of two keys to each letter, to have a handle which should stand up when the letter was not used, and be turned to the right or left, according as the letter was to be used, positively or negatively. An obvious extension of the principle of the machine would also render it possible to perform elimination. Thus, if six letters, A, B, C, D, E, F, were used, there could be an additional face which should simply take no notice of F, a third which should take no notice of F or E, a fourth which should take no notice of F, E or D; and these would suffice. With such a machine to represent AB + CD, we should proceed as follows: Put down handle E to the left. (The left hand would naturally signify the negative.) Leaving it down, put down handle A to the right and then bring it back after pulling the cord. Put down handle B to the right and pull the cord, and then restore handles B and E to the vertical. Next, put down handle F to the left and successively put down the handles C and D to the right, as before. After restoring these to the vertical, put down handles E and F to the right, and pull the cord. Then we should see on the third face
or, what comes to the same thing,
I do not think there would be any great difficulty in constructing a machine which should work the logic of relations with a large number of terms. But owing to the great variety of ways in which the same premises can be combined to produce different conclusions in that branch of logic, the machine, in its first state of development, would be no more mechanical than a hand-loom for weaving in many colors with many shuttles. The study of how to pass from such a machine as that to one corresponding to a Jacquard loom, would be likely to do very much for the improvement of logic.
1. 1. Philosophical Transactions СКАЧАТЬ