[{"@context":"https:\/\/schema.org\/","@type":"Article","@id":"https:\/\/www.therap.cz\/alan-turing-turinguv-test\/#Article","mainEntityOfPage":"https:\/\/www.therap.cz\/alan-turing-turinguv-test\/","headline":"Alan Turing, Turing\u016fv test","name":"Alan Turing, Turing\u016fv test","description":"Jack Copeland v\u011b\u0159\u00ed v platnost Turingova testu I kdy\u017e \u017e\u00e1dn\u00fd stoj t\u00edmto testem nepro\u0161el. Turingova vlastn\u00ed predikace, kterou u\u010dinil v roce 1952, byla, \u017ee ke spln\u011bn\u00ed testu dojde nejd\u0159\u00edve za sto let a d\u0159\u00edve \u017e\u00e1dn\u00fd takov\u00fd stroj nevznikne. Pokud by n\u011bkter\u00fd po\u010d\u00edta\u010d pro\u0161el, bylo by pak opr\u00e1vn\u011bn\u00e9 o n\u011bm \u0159\u00edci, \u017ee je schopen myslet a […]","datePublished":"2020-09-09","dateModified":"2023-06-02","author":{"@type":"Person","@id":"https:\/\/www.therap.cz\/author\/#Person","name":"","url":"https:\/\/www.therap.cz\/author\/","identifier":1,"image":{"@type":"ImageObject","@id":"https:\/\/secure.gravatar.com\/avatar\/64d58fab86512053c8bb518a6563e7284bb4a3422dc9af0106c3f39575364c7b?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/64d58fab86512053c8bb518a6563e7284bb4a3422dc9af0106c3f39575364c7b?s=96&d=mm&r=g","height":96,"width":96}},"publisher":{"@type":"Organization","name":"therap.cz","logo":{"@type":"ImageObject","@id":"\/logo.png","url":"\/logo.png","width":600,"height":60}},"image":{"@type":"ImageObject","@id":"https:\/\/www.therap.cz\/wp-content\/uploads\/img_a308297_w1940_t1519415412.jpg","url":"https:\/\/www.therap.cz\/wp-content\/uploads\/img_a308297_w1940_t1519415412.jpg","height":0,"width":0},"url":"https:\/\/www.therap.cz\/alan-turing-turinguv-test\/","wordCount":436,"articleBody":"Jack Copeland v\u011b\u0159\u00ed v platnost Turingova testu I kdy\u017e \u017e\u00e1dn\u00fd stoj t\u00edmto testem nepro\u0161el.  Turingova vlastn\u00ed predikace, kterou u\u010dinil v roce 1952, byla, \u017ee ke spln\u011bn\u00ed testu dojde nejd\u0159\u00edve za sto let a d\u0159\u00edve \u017e\u00e1dn\u00fd takov\u00fd stroj nevznikne.  Pokud by n\u011bkter\u00fd po\u010d\u00edta\u010d pro\u0161el, bylo by pak opr\u00e1vn\u011bn\u00e9 o n\u011bm \u0159\u00edci, \u017ee je schopen myslet a porozum\u011bt v\u00fdznamu. I kdy\u017e ne \u00fapln\u011b jako \u010dlov\u011bk.  Tv\u016frce Alan Turing se zab\u00fdval pokusem M\u011bl za \u00fakol prov\u011b\u0159it, zda se n\u011bkter\u00fd ze syst\u00e9m\u016f um\u011bl\u00e9 inteligence m\u016f\u017ee opravdu inteligentn\u011b chovat. Porovn\u00e1v\u00e1 se stroj a \u010dlov\u011bk. Prob\u00edh\u00e1 tak, \u017ee v odd\u011blen\u00fdch m\u00edstech je \u010dlov\u011bk a po\u010d\u00edta\u010d. Dost\u00e1vaj\u00ed ot\u00e1zky. Na ty n\u00e1sledn\u011b odpov\u00ed ve druh\u00e9 m\u00edstnosti. Odpov\u00edd\u00e1 bu\u010f druh\u00fd \u010dlov\u011bk, nebo druh\u00fd po\u010d\u00edta\u010d. V\u00fdsledky se pak p\u0159edaj\u00ed testuj\u00edc\u00edmu. Pokud testuj\u00edc\u00ed pozn\u00e1, zda komunikuje stroj nebo \u010dlov\u011bk, testem po\u010d\u00edta\u010d nepro\u0161el. Testuj\u00edc\u00ed nesm\u00ed rozpoznat, s k\u00fdm komunikoval.  Zkoumal podstatu v\u011bci Tvrdil, \u017ee by bylo mo\u017en\u00e9 vymyslet p\u0159\u00edstroj, kter\u00fd by spo\u010d\u00edtal d\u011blitele libovoln\u00e9ho \u010d\u00edsla.  Jin\u00fd stroj by se nau\u010dil pravidla \u0161achu. P\u0159edstavoval si jeden univerz\u00e1ln\u00ed stroj slo\u017een\u00fd z hlavice, pod n\u00ed\u017e by proch\u00e1zela p\u00e1ska s bin\u00e1rn\u00edmi \u0159adami \u010d\u00edsel.  A s dostatkem \u010dasu a posta\u010duj\u00edc\u00ed d\u00e9lkou p\u00e1sky by stroj teoreticky dok\u00e1zal spo\u010d\u00edtat odpov\u011bdi na jak\u00fdkoliv probl\u00e9m vyj\u00e1d\u0159iteln\u00fd bin\u00e1rn\u00edm k\u00f3dem.  Kdyby stroj nedovedl dan\u00fd probl\u00e9m vy\u0159e\u0161it, potom by jej nebylo mo\u017en\u00e9 objasnit pomoc\u00ed \u017e\u00e1dn\u00e9ho p\u0159\u00edstroje \u0159\u00edzen\u00e9ho mechanick\u00fdmi pravidly logiky.  Univerz\u00e1ln\u00ed stroj byl teoretick\u00fdm p\u0159edch\u016fdcem dne\u0161n\u00edch po\u010d\u00edta\u010d\u016f.   Turing\u016fv v\u00fdzkum podstatn\u011b pomohl ve druh\u00e9 sv\u011btov\u00e9 v\u00e1lce  Pomoci k\u00f3dovan\u00fdm sd\u011blen\u00edm na slavn\u00fdch stroj\u00edch Enigma, kdy\u017e postavil s pomocn\u00edky p\u0159\u00edstroj zvan\u00fd Colossus, kter\u00fd jako jedin\u00fd dok\u00e1zal Enigmu porazit.  Byl p\u0159esv\u011bd\u010den, \u017ee jednoho dne budou m\u00edt potomci Colossa mysl stejn\u011b jako lidi. Hl\u00e1sal, \u017ee pokud je stroj dostate\u010dn\u011b promy\u0161len\u00fd a jsou mu zad\u00e1na spr\u00e1vn\u00e1 pravidla, dok\u00e1\u017ee reprodukovat procesy lidsk\u00e9ho my\u0161len\u00ed prost\u0159ednictv\u00edm hrub\u00e9 s\u00edly v\u00fdpo\u010dtu.  A\u010d p\u0159em\u00fd\u0161lel Turing o po\u010d\u00edta\u010d\u00edch jakkoliv, je jist\u00e9, \u017ee Turingov\u00fdm d\u011bdictv\u00edm je po\u010d\u00edta\u010dov\u00e1 revoluce konce dvac\u00e1t\u00e9ho stolet\u00ed.                                                                                                                                                                                                                                                                                                                                                                                         3.7\/5 - (8 votes)        "},{"@context":"https:\/\/schema.org\/","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Alan Turing, Turing\u016fv test","item":"https:\/\/www.therap.cz\/alan-turing-turinguv-test\/#breadcrumbitem"}]}]