🎯 ¿Cansado de los anuncios?
Elimínalos ahora 🚀

Opinions may vary as to the complexity which is suitable in the child machine. One might try to make it as simple as possible consistently with the general principles. Alternatively one might have a complete system of logical inference «built in». In the latter case the store would be largely occupied with definitions and propositions. The propositions would have various kinds of status, e.g., well-established facts, conjectures, mathematically proved theorems, statements given by an authority, expressions having the logical form of proposition but not belief-value. Certain propositions may be described as «imperatives». The machine should be so constructed that as soon as an imperative is classed as «well established» the appropriate action automatically takes place. To illustrate this, suppose the teacher says to the machine, «Do your homework now». This may cause «Teacher says “Do your homework now”» to be included amongst the well-established facts. Another such fact might be, «Everything that teacher says is true». Combining these may eventually lead to the imperative, «Do your homework now», being included amongst the well-established facts, and this, by the construction of the machine, will mean that the homework actually gets started, but the effect is very satisfactory. The processes of inference used by the machine need not be such as would satisfy the most exacting logicians. There might for instance be no hierarchy of types. But this need not mean that type fallacies will occur, any more than we are bound to fall over unfenced cliffs. Suitable imperatives (expressed within the systems, not forming part of the rules of the system) such as «Do not use a class unless it is a subclass of one which has been mentioned by teacher» can have a similar effect to «Do not go too near the edge».

👉 Descargar el audiolibro GRATIS en Amazon
Reportar problema / Sugerencias