{"id":4464,"date":"2018-10-07T00:51:27","date_gmt":"2018-10-07T04:51:27","guid":{"rendered":"https:\/\/www.amyork.ca\/academic\/zz\/?p=4464"},"modified":"2018-10-07T01:11:30","modified_gmt":"2018-10-07T05:11:30","slug":"can-machines-think-dan-dennett","status":"publish","type":"post","link":"https:\/\/www.amyork.ca\/academic\/zz\/cognitive-psychology\/can-machines-think-dan-dennett\/","title":{"rendered":"Can Machines Think? (Dan Dennett)"},"content":{"rendered":"
-A test of a machine\u2019s ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.<\/p>\n
Alan Turing<\/u><\/p>\n
-He was the first to design a programmable computing device PTuring machine)<\/p>\n
-Whether a judge can determine if he is communicating with a human being or a computer<\/p>\n
Dennett\u2019s View of the Turing Test:<\/u><\/p>\n Descartes\u2019 View of Machines<\/u><\/p>\n -Ordinary conversation would put a strain on artificial intelligence Pi.e. computers)<\/p>\n -Nothing could pass the Turing test without being able to perform indefinitely many other clearly intelligent actions.<\/p>\n -Testing for a wider competence.<\/p>\n -i.e. if a computer wants to win at an imitation game, it needs to have a lot of world experience and knowledge.<\/p>\n -Ex: An Irish man is excited about a pint of Guinness. A human would laugh and know about that culture: the computer may not.<\/p>\n Quick-Probe Examples:<\/u><\/p>\n Operationalism:<\/u><\/p>\n -The tactic of defining the presence of some property<\/p>\n -Ex: intelligence: established once and for all by the passing of some test<\/p>\n William Wood\u2019s LUNAR program:<\/u><\/p>\n -answers scientists questions about moon rocks<\/p>\n -Describes the effect of functions that grow very rapidly as a result of combinatorial considerations<\/p>\n -In order for a computer to come off like a human, it would need to prevent combinatorial explosion<\/p>\n -the PARRY program is a trained paranoid computer patient that thinks the Mafia is out to get him<\/p>\n -Colby asked psychiatrists to be the \u201cjudge\u201d and interview the PARRY program by teletype and another human paranoid being by teletype.<\/p>\n -When asked to determine which was the computer or the human being, they couldn\u2019t.<\/p>\n -This was a legitimate Turing test.<\/p>\n -The issue: PARRY was trained to deal with the sorts of questions psychiatrists normally ask.<\/p>\n -Systems that are designed to be practical<\/p>\n -Software specialists designed to diagnose, analyze, etc.<\/p>\n -Ex: PROSPECTOR Ppredicted the existence of a large mineral deposit), MYCIN Pdiagnoses infections of the blood)<\/p>\n CYRUS program PComputerized Yale Retrieval Updating System):<\/u><\/p>\n -Named after Cyrus Vance, who was the secretary of state in the Carter admin.<\/p>\n -Because CYRUS was being fed information through daily news, the computer may have taken things too literally or not be able to answer some questions.<\/p>\n -Ask all researchers and users of computers to probe their systems before they rely on them Dennett\u2019s Conclusions:<\/u><\/p>\n Bedridden<\/u><\/p>\n -Purely language-using systems<\/p>\n","protected":false},"excerpt":{"rendered":" The Turing Test -A test of a machine\u2019s ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human. Alan Turing -He was the first to… Continue Reading Can Machines Think? (Dan Dennett)<\/span><\/a><\/p>\n","protected":false},"author":4,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[113],"tags":[],"_links":{"self":[{"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/posts\/4464"}],"collection":[{"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/comments?post=4464"}],"version-history":[{"count":0,"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/posts\/4464\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/media?parent=4464"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/categories?post=4464"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.amyork.ca\/academic\/zz\/wp-json\/wp\/v2\/tags?post=4464"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\n
Quick-Probe Assumption<\/h2>\n
\n
Combinatorial Explosion<\/h2>\n
Kenneth Colby, PARRY program<\/h2>\n
Expert Systems PPotemkin Villages)<\/h2>\n
Solution to the Expert Systems Computer Problem<\/h2>\n
\n