{"componentChunkName":"component---src-templates-book-page-js","path":"/hamming/8/","result":{"data":{"mdx":{"id":"3296911d-e819-5403-a5c5-c68ddc07cd80","body":"function _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\n/* @jsxRuntime classic */\n\n/* @jsx mdx */\nvar _frontmatter = {\n  \"author\": \"Richard W. Hamming\",\n  \"bookTitle\": \"The Art of Doing Science and Engineering\",\n  \"isBook\": false,\n  \"numSections\": 34,\n  \"tags\": [\"a\"],\n  \"templateKey\": \"book-page\",\n  \"title\": \"6 \\n Artificial Intelligence—I\"\n};\nvar layoutProps = {\n  _frontmatter: _frontmatter\n};\nvar MDXLayout = \"wrapper\";\nreturn function MDXContent(_ref) {\n  var components = _ref.components,\n      props = _objectWithoutProperties(_ref, [\"components\"]);\n\n  return mdx(MDXLayout, _extends({}, layoutProps, props, {\n    components: components,\n    mdxType: \"MDXLayout\"\n  }), mdx(ContentRef, {\n    id: 0,\n    mdxType: \"ContentRef\"\n  }, \"Having examined the history of computer applications we are naturally attracted to an examination of their future limits, not in computing capacity but rather what \", mdx(\"i\", null, \"kinds\"), \" of things computers can and perhaps cannot do. Before we get too far I need to remind you computers manipulate \", mdx(\"i\", null, \"symbols,\"), \" not \", mdx(\"i\", null, \"information;\"), \" we are simply unable to say, let alone write a program for what we mean by the word \\\"information\\\". We each believe we know what the word means, but hard thought on your part will convince you it is a fuzzy concept at best, you cannot give a definition which can be converted into a program.\"), mdx(ContentRef, {\n    id: 1,\n    mdxType: \"ContentRef\"\n  }, \"Although Babbage and Lady (Ada) Lovelace both considered slightly some of the limitations of computers, the exploration of the limits of computers really began in the late 1940s and early 1950s by, among others, Newell and Simon at RAND. For example they looked at puzzle solving, such as the classic cannibals and missionaries problem. Could machines solve them? And how would they \", mdx(\"a\", {\n    id: \"filepos191102\"\n  }), \"do it? They examined the protocols people used as they solved such problems, and tried to write a program which would produce similar results. You should not expect exactly the same result as generally no two people reported exactly the same steps in the same order of their thought processes, rather the program was to produce a similar looking pattern of reasoning. Thus they tried to model the way people did such puzzles and examine how well the model produced results \", mdx(\"i\", null, \"resembling\"), \" human results, rather than just solve the problem.\"), mdx(ContentRef, {\n    id: 2,\n    mdxType: \"ContentRef\"\n  }, \"They also started the General Problem Solver (GPS) with the idea that given about 5 general rules for solving problems they could then give the details of the particular area of a problem and the computer program would solve the problem. It didn't work too well, though very valuable by-products did come from their work such as \", mdx(\"i\", null, \"list processing\"), \". To continue with this problem solving approach they started, after their initial attack on general problem solving (which certainly promised to alleviate the programming problem to a fair extent) it was dropped, more or less, for a decade, and when revived the proposal was about 50 general rules would be needed. When that did not work, another decade and the proposal with 500 general rules, and another decade, now under the title of \", mdx(\"i\", null, \"rule based logic\"), \" and they are sometimes at 5000 rules, and I have even heard of 50,000 as the number of rules for some areas.\"), mdx(ContentRef, {\n    id: 3,\n    mdxType: \"ContentRef\"\n  }, \"There is now a whole area known as \", mdx(\"i\", null, \"Expert Systems\"), \". The idea is you talk with some experts in a field, extract their rules, put these rules into a program, and then you have an expert! Among other troubles with this idea is in many fields, especially in medicine, the world famous experts are in fact not much better than the beginners! It has been measured in many different studies! Another trouble is experts seem to use their subconscious and they can only report their conscious experience in making a diagnosis. It has been estimated it takes about 10 years of intensive work in a field to become an expert, and in this time many, many patterns are apparently laid down in the mind from which the expert then makes a subconscious initial choice of how to approach the problem as well as the subsequent steps to be used.\"), mdx(ContentRef, {\n    id: 4,\n    mdxType: \"ContentRef\"\n  }, \"In some areas rule based logic has had spectacular successes, and in some apparently similar areas there were plain failures, which indicates success depends on a large element of luck; they still do not have a firm basic understanding of when the method of rule based logic will or will not work, nor how well it will work. \", mdx(\"a\", {\n    id: \"filepos194047\"\n  })), mdx(ContentRef, {\n    id: 5,\n    mdxType: \"ContentRef\"\n  }, \"In \", mdx(\"a\", {\n    href: \"index_split_004.html#filepos19656\"\n  }, \"Chapter 1\"), \", I already brought up the topic that perhaps everything we \\\"know\\\" \", mdx(\"i\", null, \"cannot\"), \" be put into words (instructions)\\u2014cannot in the sense of impossible and not in the sense we are stupid or ignorant. Some of the features of Expert Systems we have found certainly strengthen this opinion.\"), mdx(ContentRef, {\n    id: 6,\n    mdxType: \"ContentRef\"\n  }, \"After quite a few years the field of the limits of intellectual performance by machines acquired the dubious title of \", mdx(\"i\", null, \"Artificial Intelligence\"), \" (AI), which does \", mdx(\"i\", null, \"not\"), \" have a single meaning. First, it is a variant on the question,\"), mdx(ContentRef, {\n    id: 7,\n    mdxType: \"ContentRef\"\n  }, \"Can Machines Think?\"), mdx(ContentRef, {\n    id: 8,\n    mdxType: \"ContentRef\"\n  }, \"While this is a more restricted definition than is artificial intelligence, it has a sharper focus and is a good substitute in the popular mind. This question is important to you because if you believe computers cannot think then as a prospective leader you will be slow to use computers to advance the field by your efforts, but if you believe of course computers can think then you are very apt to fall into a first class failure! Thus you cannot afford to either believe or disbelieve\\u2014you must come to your own terms with the vexing problem, \\\"To what extent can machines think?\\\"\"), mdx(ContentRef, {\n    id: 9,\n    mdxType: \"ContentRef\"\n  }, \"Note, first, it really is mis-stated\\u2014the question seems to be more, \\\"Can we write programs which will produced 'thinking' from a von Neumann type machine?\\\" The reason for the hedge is there are arguments that modern neural nets, when not simulated on a digital computer, might be able to do what no digital computer can do. But then again they might not. It is a problem we will look into at a later stage when we have more technical facts available.\"), mdx(ContentRef, {\n    id: 10,\n    mdxType: \"ContentRef\"\n  }, \"While the problem of AI can be viewed as, \\\"Which of all the things humans do can machines also do?\\\" I would prefer to ask the question in another form, \\\"Of all of life's burdens, which are those machines can relieve, or significantly ease, for us?\\\" Note while you tend to automatically think of the material side of life, pacemakers are machines connected directly to the human nervous system and help keep many people alive. People who say they do not want their life to depend on a machine seem quite conveniently to forget this. It seems to me in the long run it is on the intellectual side of life that machines can most contribute to the quality of life.\"), mdx(ContentRef, {\n    id: 11,\n    mdxType: \"ContentRef\"\n  }, \"Why is the topic of artificial intelligence important? Let me take a specific example of the need for AI. Without defining things more sharply (and without defining either \", mdx(\"i\", null, \"thinking\"), \" or \", mdx(\"i\", null, \"what a machine is\"), \" there can be no real proof one way or the other), I believe very likely in the future we will have vehicles exploring the surface of Mars. The distance between Earth and Mars at times may be so large the signaling time round trip could be 20 or more minutes. In the exploration process the vehicle must, therefore, have a fair degree of local control. When having passed between two rocks, turned a bit, and then found the ground under the front wheels was falling away, you will want prompt, \\\"sensible\\\" action on the part of the vehicle. Simple, obvious things like backing up will be inadequate to save it from destruction, and there is not time to get advice from Earth; hence some degree of \\\"intelligence\\\" should be programmed into the machine.\"), mdx(ContentRef, {\n    id: 12,\n    mdxType: \"ContentRef\"\n  }, \"This is not an isolated situation; it is increasingly typical as we use computer driven machines to do more and more things at higher and higher speeds. You cannot have a human backup\\u2014often because of the boredom factor which humans suffer from. They say piloting a plane is hours of boredom and seconds of sheer panic\\u2014not something humans were designed to cope with, though they manage to a reasonable degree. Speed of response is often essential. To repeat an example, our current fastest planes are basically unstable and have computers to stabilize them, millisecond by millisecond, which no human pilot could handle; the human can only supply the strategy in the large and leave the details in the small to the machine.\"), mdx(ContentRef, {\n    id: 13,\n    mdxType: \"ContentRef\"\n  }, \"I earlier remarked on the need to get at least some understanding of what we mean by \\\"a machine\\\" and by \\\"thinking\\\". We were discussing these thing at Bell Telephone Laboratories in the late 1940s and some one said a machine could not have organic parts, upon which I said the definition excluded any wooden parts! The first definition was retracted, but to be nasty I suggested in time we might learn how to remove a large part of a frog's nervous system and keep it alive. If we found how to use it for a storage mechanism, would it be a machine or not? If we used it as an a content addressable storage how would you feel about it being a \\\"machine\\\"?\"), mdx(ContentRef, {\n    id: 14,\n    mdxType: \"ContentRef\"\n  }, \"In the same discussion, on the thinking side, a Jesuit trained engineer gave the definition, \\\"Thinking is what humans can do and machines cannot do\\\". Well, that solves the problem once and for all, apparently. But do you like the definition? Is it really fair? As we pointed out to him then, if we start with some obvious difference at present then with improved machines and better programming we may be able to reduce the difference, and it is not clear in the long run there would be any difference left. \", mdx(\"a\", {\n    id: \"filepos200264\"\n  })), mdx(ContentRef, {\n    id: 15,\n    mdxType: \"ContentRef\"\n  }, \"Clearly we need to define \\\"thinking\\\". Most people want the definition of thinking to be such that they can think but stones, trees, and such things, cannot think. But people vary to the extent they will or will not include the higher levels of animals. People often make the mistake of saying, \\\"Thinking is what Newton and Einstein did.\\\" but by that definition most of us cannot think\\u2014and usually we do not like that conclusion! Turing, in coping with the question in a sense evaded it and made the claim that if at the end of one teletype line there was a human and at the end of another teletype line there was a suitably programmed machine, and if the average human could not tell the difference then that was a proof of \\\"thinking\\\" on the part of the machine (program).\"), mdx(ContentRef, {\n    id: 16,\n    mdxType: \"ContentRef\"\n  }, \"The Turing test is a popular approach, but it flies in the face of the standard scientific method which starts with the easier problems before facing the harder ones. Thus I soon raised the question with myself, \\\"What is the smallest or close to the smallest program I would believe could think?\\\" Clearly if the program were divided into two parts then neither piece could think. I tried thinking about it each night as I put my head on the pillow to sleep, and after a year of considering the problem and getting nowhere I decided it was the wrong question! Perhaps \\\"thinking\\\" is not a yes-no thing, but maybe it is a matter of degree.\"), mdx(ContentRef, {\n    id: 17,\n    mdxType: \"ContentRef\"\n  }, \"Let me digress and discuss some of the history of chemistry. It was long believed organic compounds could only be made by living things, there was a \", mdx(\"i\", null, \"vitalistic\"), \" aspect in living things but not in inanimate things such as stones and rocks. But around 1823 a chemist named Wohler synthesized urea, a standard by-product of humans. This was the beginning of making organic compounds in test tubes. Still, apparently even as late as 1850, the majority of chemists were holding to the \", mdx(\"i\", null, \"vitalistic\"), \" theory that only living things could make organic compounds. Well, you know from that attitude we have gone to the other extreme and now most chemists believe in principle \", mdx(\"i\", null, \"any\"), \" compound the body can make can also be made in the lab\\u2014but of course there is no proof of this, nor could there ever be. The situation is they have an increasing ability to make organic compounds, and see no reason they cannot make any compound which that can exist in Nature as well as many which do not. Chemists have passed from the \", mdx(\"i\", null, \"vitalistic\"), \" theory of chemistry to the opposite extreme of a \", mdx(\"i\", null, \"non-vitalistic\"), \" theory of chemistry.\"), mdx(ContentRef, {\n    id: 18,\n    mdxType: \"ContentRef\"\n  }, \"Religion unfortunately enters into discussions of the problem of machine thinking, and hence we have both vitalistic and \", mdx(\"a\", {\n    id: \"filepos203371\"\n  }), \"non-vitalistic theories of \\\"machines vs. humans\\\". For the Christian religions their Bible says, \\\"God made Man in His image\\\". If we can in turn create machines in our image then we are in some sense the equal of God, and this is a bit embarrassing! Most religions, one way or the other, make man into more than a collection of molecules, indeed man is often distinguished from the rest of the animal world by such things as a soul, or some other property. As to the soul, in the Late Middle Ages some people, wanting to know when the soul departed from the dead body, put a dying man on a scale and watched for the sudden change in weight\\u2014but all they saw was a slow loss as the body decayed\\u2014apparently the soul, which they were sure the man had, did not have material weight.\"), mdx(ContentRef, {\n    id: 19,\n    mdxType: \"ContentRef\"\n  }, \"Even if you believe in evolution, still there can be a moment when God, or the gods, stepped in and gave man special properties which distinguish him from the rest of living things. This belief in an essential difference between man and the rest of the world is what makes many people believe machines can never, unless we ourselves become like the gods, be the same as a human in such details as thinking, for example. Such people are forced, like the above mentioned Jesuit trained engineer, to make the definition of thinking to be what machines cannot do. Usually it is not so honestly stated as he did, rather it is disguised somehow behind a facade of words, but the intention is the same!\"), mdx(ContentRef, {\n    id: 20,\n    mdxType: \"ContentRef\"\n  }, \"Physics regards you as a collection of molecules in a radiant energy field and there is, in strict physics, \", mdx(\"i\", null, \"nothing else\"), \". Democritus (b. around 460 B.C.) said in ancient Greek times, \\\"All is atoms and void\\\". This is the stance of the \", mdx(\"i\", null, \"hard AI\"), \" people; there is no essential difference between machines and humans, hence by suitably programming machines then machines can do anything humans can do. Their failures to produce thinking in significant detail is, they believe, merely the failure of programmers to understand what they are doing, and not an essential limitation.\"), mdx(ContentRef, {\n    id: 21,\n    mdxType: \"ContentRef\"\n  }, \"At the other extreme of the AI scale, some of us, when considering our own feelings, believe we have \", mdx(\"i\", null, \"self-awareness\"), \" and \", mdx(\"i\", null, \"selfconsciousness\"), \"\\u2014though we are not able to give satisfactory tests to prove these things exist. I can get a machine to print out, \\\"I have a soul\\\", or \\\"I am self-aware.\\\", or \\\"I have self-consciousness.\\\", and you would not be impressed with such statements from a machine. But from humans you are inclined to give greater credence to such remarks, based on the belief that you, by introspection, feel you have such properties (things), and you have learned by long \", mdx(\"a\", {\n    id: \"filepos206369\"\n  }), \"experience in life other humans are similar to you\\u2014though clearly racism still exists which asserts there are differences\\u2014me being always the better person!\"), mdx(ContentRef, {\n    id: 22,\n    mdxType: \"ContentRef\"\n  }, \"We are at a stalemate at this point in the discussion of AI; we can each assert as much as we please, but it proves nothing at all to most people. So let us turn to the record of AI successes and failures.\"), mdx(ContentRef, {\n    id: 23,\n    mdxType: \"ContentRef\"\n  }, \"AI people have always made extravagant claims which have not been borne out\\u2014not even closely in most cases. Newell and Simon in 1958 predicted in 10 years the next world champion in chess would be a computer program. Unfortunately similar, as yet unrealized, claims have been made by most of the AI leaders in the public eye. Still, startling results have been produced.\"), mdx(ContentRef, {\n    id: 24,\n    mdxType: \"ContentRef\"\n  }, \"I must again digress, this time to point out why game playing has such a prominent role in AI research. The rules of a game are clear beyond argument, and success or failure are also\\u2014in short, the problem is well defined in any reasonable sense. It is not that we particularly want machines to play games, but they provide a very good testing ground of our ideas on how to get started in AI.\"), mdx(ContentRef, {\n    id: 25,\n    mdxType: \"ContentRef\"\n  }, \"Chess, from the beginning, was regarded as a very good test since it was widely believed at that time chess requires thinking \", mdx(\"i\", null, \"beyond any doubt\"), \". Shannon proposed a way of writing chess playing programs (we call them chess playing machines but it is really mainly a matter of programming). Los Alamos, with a primitive MANIAC machine tried 6\\xD76 chess boards, dropping the two bishops on each side, and got moderate results. We will return to the history of chess playing programs later.\"), mdx(ContentRef, {\n    id: 26,\n    mdxType: \"ContentRef\"\n  }, \"Let us examine how one might write a program for the much simpler game of three dimensional tic-tac-toe. We set aside simple two dimensional tic-tac-toe since it has a known strategy for getting a draw, and there is no possibility of win against a prudent player. Games which have a known strategy of playing simply are not exhibiting thinking\\u2014so we believe at the moment.\"), mdx(ContentRef, {\n    id: 27,\n    mdxType: \"ContentRef\"\n  }, \"As you examine the 4\\xD74\\xD74 cube there are 64 squares, and 76 straight lines through them. Any one line is a \", mdx(\"i\", null, \"win\"), \" if you can get all four of the positions filled with your pieces. You next note the 8 corner locations, and the 8 center locations, all have more lines through them than the others; indeed there is an inversion of the cube such that the center points go to the corners and the corners go to the center while preserving all straight lines\\u2014hence a duality which can be exploited if you wish. \"), mdx(ContentRef, {\n    id: 28,\n    mdxType: \"ContentRef\"\n  }, \"For a program to play 4\\xD74\\xD74 tic-tac-toe it is first necessary to pick legal moves. Then in the opening moves you tend to place your pieces on these \\\"hot\\\" spots, and you use a random strategy since otherwise, since if you play a standard game then the opponent can slowly explore it until a weakness is uncovered which can be systematically exploited. This use of randomness, when there are essentially indifferent moves, is a central part of all game playing programs.\"), mdx(ContentRef, {\n    id: 29,\n    mdxType: \"ContentRef\"\n  }, \"We next formulate some rules to be applied sequentially.\"), mdx(ContentRef, {\n    id: 30,\n    mdxType: \"ContentRef\"\n  }, \"1. If you have 3 men on a line and it is still \\\"open\\\" then play it and win.\"), mdx(ContentRef, {\n    id: 31,\n    mdxType: \"ContentRef\"\n  }, \"2. If you have no immediate win, and if the opponent has 3 men on a line, then you must block it.\"), mdx(ContentRef, {\n    id: 32,\n    mdxType: \"ContentRef\"\n  }, \"3. If you have a fork (\", mdx(\"a\", {\n    href: \"#filepos211821\"\n  }, \"Figure 6.I\"), \"), take it since then on the next move you have a win, as the opponent cannot win in one move.\"), mdx(ContentRef, {\n    id: 33,\n    mdxType: \"ContentRef\"\n  }, \"4. If the opponent has a fork you must block it.\"), mdx(ContentRef, {\n    id: 34,\n    mdxType: \"ContentRef\"\n  }, \"After this there are apparently no definite rules to follow in making your next move. Hence you begin to look for \\\"forcing moves\\\", ones which will get you to some place where you have a winning combination. Thus 2 pieces on an \\\"open\\\" line means you can place a third and the opponent will be forced to block the line (but you must be careful that the blocking move does not produce three in a line for the opponent and force you to go on the defensive). In the process of making several forcing moves you may be able to create a fork, and then you have win! But these rules are vague. \"), mdx(ContentRef, {\n    id: 35,\n    mdxType: \"ContentRef\"\n  }, \"Figure 6.I\"), mdx(ContentRef, {\n    id: 36,\n    mdxType: \"ContentRef\"\n  }, mdx(\"a\", {\n    id: \"filepos212137\"\n  }), \" Forcing moves which are on \\\"hot\\\" places and where the opponent' s defense must be on a \\\"cool\\\" places seem to favor you, but does not guarantee a win. In starting a sequence of forcing moves, if you lose the initiative, then almost certainly the opponent can start a sequence of forcing moves on you and gain a win. Thus when to go on the attack is a touchy matter; too soon and you lose the initiative, too late and the opponent starts and wins. It is not possible, so far as I know to give an exact rule of when to do so.\"), mdx(ContentRef, {\n    id: 37,\n    mdxType: \"ContentRef\"\n  }, \"This is the standard structure of a program to play a game on a computer. Programs must first require you check the move is legal before any other step, but this is a minor detail. Then there is usually a set of more or less formal rules to be obeyed, followed by some much vaguer rules. Thus a game program has a lot of \", mdx(\"i\", null, \"heuristics\"), \" in it (heuristic\\u2014to invent or discover), moves which are plausible and likely to lead you to a win, but are \", mdx(\"i\", null, \"not\"), \" guaranteed to do so.\"), mdx(ContentRef, {\n    id: 38,\n    mdxType: \"ContentRef\"\n  }, \"Early in the field of AI Art Samuel, then at IBM, wrote a checker playing program, checkers being thought to be easier than chess which had proved to be a real stumbling block. The formula he wrote for playing checkers had a large number of rather arbitrary parameters in the weighting functions for making decisions, such as for control of the center, passed pieces, kings, mobility, pinned pieces, etc. Samuel made a copy of the program and then slightly altered one (or more) of these parameters. Then he made one formula play, say, ten games against the other, and the formula which won the most games was clearly (actually only probably) the better program. The machine went on perturbing the same parameters until it came to a local optimum, where upon it shifted to other parameters. Thus it went around and around, repeatedly using the same parameters, gradually emerging with a significantly better checker playing program\\u2014certainly much better than was Samuel himself. The program even beat a Connecticut State checker champion!\"), mdx(ContentRef, {\n    id: 39,\n    mdxType: \"ContentRef\"\n  }, \"Is it not fair to say, \\\"The program learned from experience\\\"? Your immediate objection is there was a program telling the machine how to learn. But when you take a course in Euclidean geometry is not the teacher putting a similar learning program into you? Poorly, to be sure, but is that not, in a real sense, what a course in geometry is all about? You enter the course and cannot do problems; the teacher puts into you a program and at the end of the course you can solve such problems. Think it over carefully. If you deny the machine learns from experience because you claim the program was told (by the human programmer) how to do improve its performance, then is not the situation much the same with you, except you are born with a somewhat larger initial program compared to the machine when it leaves the manufacturer's hands? Are you sure you are not merely \\\"programmed\\\" in life by what by chance events happen to you?\"), mdx(ContentRef, {\n    id: 40,\n    mdxType: \"ContentRef\"\n  }, \"We are beginning to find not only is intelligence not adequately defined so arguments can be settled scientifically, but a lot of other associated words like, computer, learning, information, ideas, decisions (hardly a mere branching of a program, though branch points are often called decision points to make the programmers feel more important), expert behavior\\u2014all are a bit fuzzy in our minds when we get down to the level of testing them via a program in a computer. Science has traditionally appealed to experimental evidence and not idle words, and so far science seem to have been more effective than philosophy in improving our way of life. The future can, of course, be different.\"), mdx(ContentRef, {\n    id: 41,\n    mdxType: \"ContentRef\"\n  }, \"In this chapter we have \\\"set the stage\\\" for a further discussion of AI. We have also claimed it is not a topic you can afford to ignore. Although there seems to be no hard, factual results, and perhaps there can never be since the very words are ill-defined and are open to modification and various interpretations, still you must come to grips with it. In particular, when a program is written which does meet some earlier specification for a reasonable test of computer learning, originality, creativity, or intelligence, then it is promptly seen by many people the test had a mechanical solution. This is true even if random numbers are involved, and given the same test twice the machine will get a solution which differs slightly from the earlier one, much as humans seldom play exactly the same game of chess twice in a row. What is a reasonable, practical test of machine learning? Or are you going to claim, as the earlier cited Jesuit trained engineer did, by definition learning, creativity, originality, and intelligence are what machines cannot do? Or are you going to try to hide this blatant statement and conceal it in some devious fashion which does not really alter the situation?\"), mdx(ContentRef, {\n    id: 42,\n    mdxType: \"ContentRef\"\n  }, \"In a sense you will never really grasp the whole problem of AI until you get inside and try your hand at finding what you mean and what machines can do. Before the checker playing program which learned was exposed in simple detail, you probably thought machines could not learn from experience\\u2014now you may feel what was done was not learning but clever cheating, though clearly the program modified its behavior depending on its experiences. \", mdx(\"i\", null, \"You must struggle with your own beliefs if you are to make any progress in understanding the possibilities and limitations of computers in the intellectual area.\"), \" To do this adequately you must formalize your beliefs and then criticize them severely, arguing one side against the other, until you have a fair idea of the strengths and weakness of both sides. Most students start out anti-AI; some are proAI; and if you are either one of these then you must try to undo your biases in this important matter. In the next chapter we will supply more surprising data on what machines have done, but you must make up your own mind on this important topic. False beliefs will mean you will not participate significantly in the inevitable and extensive computerization of your organization and society generally. In many senses the computer revolution has only begun! \"));\n}\n;\nMDXContent.isMDXComponent = true;","fields":{"slug":"/hamming/8/"},"frontmatter":{"isBook":false,"title":"6 \n Artificial Intelligence—I","bookTitle":"The Art of Doing Science and Engineering","numSections":34,"tags":["a"],"author":"Richard W. Hamming"}}},"pageContext":{"id":"3296911d-e819-5403-a5c5-c68ddc07cd80"}},"staticQueryHashes":["4080856488"]}