Difference between revisions of "Intelligence"
(Created page with "==Full Title or Meme== ==References==") |
(→Full Title or Meme) |
||
| Line 1: | Line 1: | ||
==Full Title or Meme== | ==Full Title or Meme== | ||
| + | |||
| + | ==Context== | ||
| + | |||
| + | [t mightbe argued that thereisafundamental contradiction in the idea Ofa | ||
| + | machine with intelligence. It is certainly true that 'acting like a machine', has | ||
| + | become synonymous with lack of adaptability. But the reason for this is obvious. | ||
| + | Machines in the past have had very little storage, and there has been no question | ||
| + | of the machine having any discretion. The argument might however be put into | ||
| + | more aggressive form. It has for instance been shown that with certain logical | ||
| + | systems there can be no machine which will distinguish provable formulae of th | ||
| + | stem from unprovable, i.e. that there is no test that the machine can apply whic | ||
| + | ill divide propositions with certainty into these two classes. Thus if a machine | ||
| + | made for this purpose it must in some cases fail to give an answer. On the other | ||
| + | hand if a mathematician is confronted with such a problem he would search around | ||
| + | and find new methods of proof, so that he ought eventually to be able to reach | ||
| + | decision about any given formula. This would be the argument. Against it I would | ||
| + | say that fair play must be given to the machine. Instead of it sometimes giving n | ||
| + | answer we could arrange that it gives occasional wrong answers. But the huma | ||
| + | mathematician would likewise make blunders when trying out new techniques. | ||
| + | It is easy for us to regard these blunders as not counting and give him another | ||
| + | chance, but the machine would probably be allowed no mercy. In other wor | ||
| + | then, if a machine is expected to be infallible, it cannot also be intelligent.<ref>Alan M. Turing, ''Lecture to the London Mathematical Society'' (1947-02-20) https://www.vordenker.de/downloads/turing-vorlesung.pdf</ref> | ||
==References== | ==References== | ||
Revision as of 15:05, 8 July 2024
Full Title or Meme
Context
[t mightbe argued that thereisafundamental contradiction in the idea Ofa machine with intelligence. It is certainly true that 'acting like a machine', has become synonymous with lack of adaptability. But the reason for this is obvious. Machines in the past have had very little storage, and there has been no question of the machine having any discretion. The argument might however be put into more aggressive form. It has for instance been shown that with certain logical systems there can be no machine which will distinguish provable formulae of th stem from unprovable, i.e. that there is no test that the machine can apply whic ill divide propositions with certainty into these two classes. Thus if a machine made for this purpose it must in some cases fail to give an answer. On the other hand if a mathematician is confronted with such a problem he would search around and find new methods of proof, so that he ought eventually to be able to reach decision about any given formula. This would be the argument. Against it I would say that fair play must be given to the machine. Instead of it sometimes giving n answer we could arrange that it gives occasional wrong answers. But the huma mathematician would likewise make blunders when trying out new techniques. It is easy for us to regard these blunders as not counting and give him another chance, but the machine would probably be allowed no mercy. In other wor then, if a machine is expected to be infallible, it cannot also be intelligent.[1]
References
- ↑ Alan M. Turing, Lecture to the London Mathematical Society (1947-02-20) https://www.vordenker.de/downloads/turing-vorlesung.pdf
