@prefix rdf: . @prefix dbpedia: . @prefix ns2: . dbpedia:Turing_machine rdf:type ns2:EnglishInventions , ns2:FormalMethods . @prefix owl: . dbpedia:Turing_machine owl:sameAs . @prefix foaf: . @prefix ns5: . dbpedia:Turing_machine foaf:page ns5:Turing_machine . @prefix dbpprop: . dbpedia:Turing_machine dbpprop:reference , , , , , , , , . @prefix ns7: . dbpedia:Turing_machine dbpprop:reference ns7:tour2 . @prefix rdfs: . dbpedia:Turing_machine rdfs:label "Turing-g\u00E9p"@hu , "Macchina di Turing"@it , "\u041C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0438\u043D\u0433\u0430"@uk , "Turingmaschine"@de , "M\u00E0quina de Turing"@ca , "Turingmaskin"@no , "Machine de Turing"@fr , "M\u00E1quina de Turing"@pt , "Turingin kone"@fi , "\u041C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430"@ru , "Maszyna Turinga"@pl , "Turing machine"@en , "Turing\u016Fv stroj"@cs , "\u56FE\u7075\u673A"@zh , "Turingmachine"@nl , "M\u00E1quina de Turing"@es , "Ma\u015Fin\u0103 Turing"@ro , "Turing makinesi"@tr , "\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3"@ja , "Turingmaskin"@sv . @prefix dbpedia-owl: . dbpedia:Turing_machine dbpedia-owl:thumbnail ; dbpprop:abstract "Una macchina di Turing (termine spesso abbreviato con MdT) \u00E8 una macchina formale, cio\u00E8 un sistema formale che pu\u00F2 descriversi come un meccanismo ideale, ma in linea di principio realizzabile concretamente, che pu\u00F2 trovarsi in stati ben determinati, opera su stringhe in base a regole ben precise e costituisce un modello di calcolo. Essa ha la particolarit\u00E0 di essere retta da regole di natura molto semplice, ovvero di potersi descrivere come costituita da meccanismi elementari molto semplici; inoltre \u00E8 possibile presentare a livello sintetico le sue evoluzioni mediante descrizioni meccanicistiche piuttosto intuitive. D'altra parte essa ha la portata computazionale che si presume essere la massima: si dimostra infatti che essa \u00E8 equivalente, ossia in grado di effettuare le stesse elaborazioni di tutti gli altri modelli di calcolo di pi\u00F9 ampia portata. Tra questi modelli di calcolo ricordiamo le funzioni ricorsive di Jacques Herbrand e Kurt G\u00F6del, il lambda calcolo di Alonzo Church e Stephen Kleene, la logica combinatoria di Moses Sch\u00F6nfinkel e Haskell Curry, gli algoritmi di Markov, i sistemi di Thue, i sistemi di Post, le macchine di Hao Wang e le macchine a registri elementari o RAM astratte di Marvin Minsky. Di conseguenza si \u00E8 consolidata la convinzione che per ogni problema calcolabile esista una MdT in grado di risolverlo: questa \u00E8 la cosiddetta congettura di Church-Turing, la quale postula in sostanza che per ogni funzione calcolabile esista una macchina di Turing equivalente, ossia che l'insieme delle funzioni calcolabili coincida con quello delle funzioni ricorsive. La MdT come modello di calcolo \u00E8 stato introdotta nel 1936 da Alan Turing per dare risposta all'Entscheidungsproblem (problema di decisione) proposto da Hilbert nel suo programma di fondazione formalista della matematica. Per le sue caratteristiche, il modello della MdT \u00E8 un efficace strumento teorico che viene largamente usato nella teoria della calcolabilit\u00E0 e nello studio della complessit\u00E0 degli algoritmi. Per definire in modo formalmente preciso la nozione di algoritmo oggi preferenzialmente si sceglie di ricondurlo alle elaborazioni effettuabili con macchine di Turing."@it , "Turingin kone on teoreettinen malli sille miten tietokone toimii. Mallin kehitti matemaatikko Alan Turing vuonna 1936 m\u00E4\u00E4ritell\u00E4kseen tarkasti k\u00E4sitteen algoritmi. Turingin kone muistuttaa varhaista mekaanista tietokonetta, vaikkakaan yht\u00E4\u00E4n ohjelmoitavaa tietokonetta ei viel\u00E4 ollut sen keksimishetkell\u00E4 rakennettu. Turingin kone on tarkoitettu algoritmisen ratkaisun mahdollisuuksien rajojen tarkkailuun. Turingin kone, joka pystyy simuloimaan mit\u00E4 tahansa muuta Turingin konetta siihen ladattavien ohjeiden mukaan, on nimelt\u00E4\u00E4n universaali Turingin kone. Turingin koneen voi k\u00E4sitt\u00E4\u00E4 tietokoneohjelmana, joka toimii tietyn sy\u00F6tteen mukaan, ja universaalikoneen ohjelmoitavana tietokoneena."@fi , "\u56FE\u7075\u673A\uFF08\u82F1\u8BED\uFF1ATuring Machine\uFF0C\u53C8\u79F0\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF09\u662F\u82F1\u56FD\u6570\u5B66\u5BB6\u963F\u5170\u00B7\u56FE\u7075\u4E8E1936\u5E74\u63D0\u51FA\u7684\u4E00\u79CD\u62BD\u8C61\u8BA1\u7B97\u6A21\u578B\uFF0C\u5176\u66F4\u62BD\u8C61\u7684\u610F\u4E49\u4E3A\u4E00\u79CD\u6570\u5B66\u903B\u8F91\u673A\uFF0C\u53EF\u4EE5\u770B\u4F5C\u7B49\u4EF7\u4E8E\u4EFB\u4F55\u6709\u9650\u903B\u8F91\u6570\u5B66\u8FC7\u7A0B\u7684\u7EC8\u6781\u5F3A\u5927\u903B\u8F91\u673A\u5668\u3002"@zh , "Ma\u015Finile Turing sunt ni\u015Fte mecanisme extrem de elementare de dispozitive de prelucrare a simbolurilor care \u2014 \u00EEn ciuda simplit\u0103\u0163ii lor \u2014 pot fi adaptate pentru a simula logica oric\u0103rui calculator ce poate fi construit. Modelele au fost descrise \u00EEn 1936 de c\u0103tre Alan Turing. De\u015Fi modelele erau proiectate ini\u0163ial pentru a fi fezabile din punct de vedere tehnic, ma\u015Finile Turing nu au fost g\u00E2ndite pentru a fi tehnologii practice de calcul, ci un experiment mental despre limitele calculului mecanic; astfel, ele nu a fost niciodat\u0103 construite. Studiul propriet\u0103\u0163ilor lor abstracte este util \u00EEn informatic\u0103 \u015Fi teoria complexit\u0103\u0163ii. Conjectura Church-Turing postuleaz\u0103 c\u0103 orice problem\u0103 de calcul bazat\u0103 pe o procedur\u0103 algoritmic\u0103 poate fi rezolvat\u0103 de c\u0103tre o ma\u015Fin\u0103 Turing. Aceast\u0103 \"conjectur\u0103\" nu are o formulare matematic\u0103, deoarece nu se bazeaz\u0103 pe o defini\u0163ie precis\u0103 a conceptului de procedur\u0103 algoritmic\u0103. \u00CEn schimb, este posibil de a se defini o no\u0163iune de \"sistem acceptabil de programare\" \u015Fi de a se demonstra c\u0103 \"puterea de calcul\" a unui asemenea sistem este echivalent\u0103 cu cea a unei ma\u015Fini Turing (se vorbe\u015Fte \u00EEn acest caz de un limbaj de programare Turing-complet). O ma\u015Fin\u0103 Turing capabil\u0103 de a simula orice alt\u0103 ma\u015Fin\u0103 Turing se nume\u015Fte ma\u015Fin\u0103 Turing universal\u0103 (sau ma\u015Fin\u0103 universal\u0103). O defini\u0163ie mai orientat\u0103 matematic a fost introdus\u0103 de Alonzo Church, ale c\u0103rui lucr\u0103ri din domeniul calculului lambda s-au \u00EEmpletiit cu cele ale lui Turing \u00EEntr-o teorie formal\u0103 a calculului cunoscut\u0103 sub numele de Conjectura Church-Turing. Aceasta postuleaz\u0103 c\u0103 orice problem\u0103 de calcul bazat\u0103 pe o procedur\u0103 algoritmic\u0103 poate fi rezolvat\u0103 de c\u0103tre o ma\u015Fin\u0103 Turing."@ro , "La m\u00E1quina de Turing es un modelo computacional introducido por Alan Turing en el trabajo \u201COn computable numbers, with an application to the Entscheidungsproblem\u201D, publicado por la Sociedad Matem\u00E1tica de Londres en 1936, en el cual se estudiaba la cuesti\u00F3n planteada por David Hilbert sobre si las matem\u00E1ticas son decidibles, es decir, si hay un m\u00E9todo definido que pueda aplicarse a cualquier sentencia matem\u00E1tica y que nos diga si esa sentencia es cierta o no. Turing construy\u00F3 un modelo formal de computador, la m\u00E1quina de Turing, y demostr\u00F3 que exist\u00EDan problemas que una m\u00E1quina no pod\u00EDa resolver. La m\u00E1quina de Turing es un modelo matem\u00E1tico abstracto que formaliza el concepto de algoritmo."@es , "\u041C\u0430\u0448\u0438\u0301\u043D\u0430 \u0422\u044C\u044E\u0301\u0440\u0438\u043D\u0433\u0430 (\u041C\u0422) \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u044B\u0439 \u0438\u0441\u043F\u043E\u043B\u043D\u0438\u0442\u0435\u043B\u044C (\u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0430\u044F \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u0430\u044F \u043C\u0430\u0448\u0438\u043D\u0430). \u0411\u044B\u043B\u0430 \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u0430 \u0410\u043B\u0430\u043D\u043E\u043C \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u043E\u043C \u0432 1936 \u0433\u043E\u0434\u0443 \u0434\u043B\u044F \u0444\u043E\u0440\u043C\u0430\u043B\u0438\u0437\u0430\u0446\u0438\u0438 \u043F\u043E\u043D\u044F\u0442\u0438\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0430. \u041C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430 \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u0440\u0430\u0441\u0448\u0438\u0440\u0435\u043D\u0438\u0435\u043C \u043A\u043E\u043D\u0435\u0447\u043D\u043E\u0433\u043E \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0430 \u0438, \u0441\u043E\u0433\u043B\u0430\u0441\u043D\u043E \u0442\u0435\u0437\u0438\u0441\u0443 \u0427\u0451\u0440\u0447\u0430 \u2014 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430, \u0441\u043F\u043E\u0441\u043E\u0431\u043D\u0430 \u0438\u043C\u0438\u0442\u0438\u0440\u043E\u0432\u0430\u0442\u044C \u0432\u0441\u0435 \u0434\u0440\u0443\u0433\u0438\u0435 \u0438\u0441\u043F\u043E\u043B\u043D\u0438\u0442\u0435\u043B\u0438 (\u0441 \u043F\u043E\u043C\u043E\u0449\u044C\u044E \u0437\u0430\u0434\u0430\u043D\u0438\u044F \u043F\u0440\u0430\u0432\u0438\u043B \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0430), \u043A\u0430\u043A\u0438\u043C-\u043B\u0438\u0431\u043E \u043E\u0431\u0440\u0430\u0437\u043E\u043C \u0440\u0435\u0430\u043B\u0438\u0437\u0443\u044E\u0449\u0438\u0435 \u043F\u0440\u043E\u0446\u0435\u0441\u0441 \u043F\u043E\u0448\u0430\u0433\u043E\u0432\u043E\u0433\u043E \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u044F, \u0432 \u043A\u043E\u0442\u043E\u0440\u043E\u043C \u043A\u0430\u0436\u0434\u044B\u0439 \u0448\u0430\u0433 \u0432\u044B\u0447\u0438\u0441\u043B\u0435\u043D\u0438\u044F \u0434\u043E\u0441\u0442\u0430\u0442\u043E\u0447\u043D\u043E \u044D\u043B\u0435\u043C\u0435\u043D\u0442\u0430\u0440\u0435\u043D."@ru , "\u041C\u0430\u0448\u0438\u0301\u043D\u0430 \u0422\u044E\u0301\u0440\u0438\u043D\u0433\u0430 \u2014 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0435 \u043F\u043E\u043D\u044F\u0442\u0442\u044F, \u0432\u0432\u0435\u0434\u0435\u043D\u0435 \u0434\u043B\u044F \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u043E\u0433\u043E \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u043D\u044F \u0456\u043D\u0442\u0443\u0456\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443. \u041D\u0430\u0437\u0432\u0430\u043D\u0430 \u043D\u0430 \u0447\u0435\u0441\u0442\u044C \u0430\u043D\u0433\u043B\u0456\u0439\u0441\u044C\u043A\u043E\u0433\u043E \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0430 \u0410\u043B\u0430\u043D\u0430 \u0422\u044E\u0440\u0438\u043D\u0433\u0430, \u044F\u043A\u0438\u0439 \u0437\u0430\u043F\u0440\u043E\u043F\u043E\u043D\u0443\u0432\u0430\u0432 \u0446\u0435 \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0443 1936. \u0410\u043D\u0430\u043B\u043E\u0433\u0456\u0447\u043D\u0443 \u043A\u043E\u043D\u0441\u0442\u0440\u0443\u043A\u0446\u0456\u044E \u043C\u0430\u0448\u0438\u043D\u0438 \u0437\u0433\u043E\u0434\u043E\u043C \u0456 \u043D\u0435\u0437\u0430\u043B\u0435\u0436\u043D\u043E \u0432\u0456\u0434 \u0422\u044E\u0440\u0438\u043D\u0433\u0430 \u0432\u0432\u0456\u0432 \u0430\u043C\u0435\u0440\u0438\u043A\u0430\u043D\u0441\u044C\u043A\u0438\u0439 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A \u0415\u043C\u0456\u043B\u044C \u041F\u043E\u0441\u0442. \u041E\u0441\u043D\u043E\u0432\u043D\u0430 \u0456\u0434\u0435\u044F, \u0449\u043E \u043B\u0435\u0436\u0438\u0442\u044C \u0432 \u043E\u0441\u043D\u043E\u0432\u0456 \u043C\u0430\u0448\u0438\u043D\u0438 \u0422\u044E\u0440\u0438\u043D\u0433\u0430, \u0434\u0443\u0436\u0435 \u043F\u0440\u043E\u0441\u0442\u0430. \u041C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0438\u043D\u0433\u0430 - \u0446\u0435 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0430 \u043C\u0430\u0448\u0438\u043D\u0430 (\u0430\u0432\u0442\u043E\u043C\u0430\u0442), \u0449\u043E \u043F\u0440\u0430\u0446\u044E\u0454 \u0437\u0456 \u0441\u0442\u0440\u0456\u0447\u043A\u043E\u044E, \u0449\u043E \u0441\u043A\u043B\u0430\u0434\u0430\u0454\u0442\u044C\u0441\u044F \u0456\u0437 \u043E\u043A\u0440\u0435\u043C\u0438\u0445 \u043A\u043E\u043C\u0456\u0440\u043E\u043A, \u0432 \u044F\u043A\u0438\u0445 \u0437\u0430\u043F\u0438\u0441\u0430\u043D\u043E \u0441\u0438\u043C\u0432\u043E\u043B\u0438. \u041C\u0430\u0448\u0438\u043D\u0430 \u0442\u0430\u043A\u043E\u0436 \u043C\u0430\u0454 \u0433\u043E\u043B\u0456\u0432\u043A\u0443 \u0434\u043B\u044F \u0437\u0430\u043F\u0438\u0441\u0443 \u0442\u0430 \u0447\u0438\u0442\u0430\u043D\u043D\u044F \u0441\u0438\u043C\u0432\u043E\u043B\u0456\u0432 \u0456\u0437 \u043A\u043E\u043C\u0456\u0440\u043E\u043A \u0456 \u044F\u043A\u0430 \u043C\u043E\u0436\u0435 \u0440\u0443\u0445\u0430\u0442\u0438\u0441\u044C \u0432\u0437\u0434\u043E\u0432\u0436 \u0441\u0442\u0440\u0456\u0447\u043A\u0438. \u041D\u0430 \u043A\u043E\u0436\u043D\u043E\u043C\u0443 \u043A\u0440\u043E\u0446\u0456, \u043C\u0430\u0448\u0438\u043D\u0430 \u0437\u0447\u0438\u0442\u0443\u0454 \u0441\u0438\u043C\u0432\u043E\u043B \u0456\u0437 \u043A\u043E\u043C\u0456\u0440\u043A\u0438, \u043D\u0430 \u044F\u043A\u0443 \u0432\u043A\u0430\u0437\u0443\u0454 \u0433\u043E\u043B\u0456\u0432\u043A\u0430, \u0442\u0430, \u043D\u0430 \u043E\u0441\u043D\u043E\u0432\u0456 \u0437\u0447\u0438\u0442\u0430\u043D\u043E\u0433\u043E \u0441\u0438\u043C\u0432\u043E\u043B\u0443 \u0442\u0430 \u0432\u043D\u0443\u0442\u0440\u0456\u0448\u043D\u044C\u043E\u0433\u043E \u0441\u0442\u0430\u043D\u0443 \u0440\u043E\u0431\u0438\u0442\u044C\u0441\u044F \u043D\u0430\u0441\u0442\u0443\u043F\u043D\u0438\u0439 \u043A\u0440\u043E\u043A. \u041F\u0440\u0438 \u0446\u044C\u043E\u043C\u0443, \u043C\u0430\u0448\u0438\u043D\u0430 \u043C\u043E\u0436\u0435 \u0437\u043C\u0456\u043D\u0438\u0442\u0438 \u0441\u0432\u0456\u0439 \u0441\u0442\u0430\u043D, \u0437\u0430\u043F\u0438\u0441\u0430\u0442\u0438 \u0456\u043D\u0448\u0438\u0439 \u0441\u0438\u043C\u0432\u043E\u043B \u0432 \u043A\u043E\u043C\u0456\u0440\u043A\u0443, \u0430\u0431\u043E \u043F\u0435\u0440\u0435\u0441\u0443\u043D\u0443\u0442\u0438 \u0433\u043E\u043B\u0456\u0432\u043A\u0443 \u043D\u0430 \u043E\u0434\u043D\u0443 \u043A\u043E\u043C\u0456\u0440\u043A\u0443 \u043B\u0456\u0432\u043E\u0440\u0443\u0447 \u0430\u0431\u043E \u043F\u0440\u0430\u0432\u043E\u0440\u0443\u0447."@uk , "\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3 \u306F\u8A08\u7B97\u6A21\u578B\u306E\u3072\u3068\u3064\u3002\u3059\u306A\u308F\u3061\u3001\u8A08\u7B97\u6A5F\u3092\u6570\u5B66\u7684\u306B\u8B70\u8AD6\u3059\u308B\u305F\u3081\u306E\u3001\u5358\u7D14\u5316\u30FB\u7406\u60F3\u5316\u3055\u308C\u305F\u4EEE\u60F3\u6A5F\u68B0\u3067\u3042\u308B\u3002"@ja , "Die Turingmaschine ist ein von dem britischen Mathematiker Alan Turing 1936 entwickeltes Modell, um eine Klasse von berechenbaren Funktionen zu bilden. Sie geh\u00F6rt zu den grundlegenden Konzepten der Informatik. Das Modell wurde im Rahmen des von David Hilbert im Jahr 1920 formulierten Hilbertprogramms, speziell zur L\u00F6sung des so genannten Entscheidungsproblems, in der Schrift \"On Computable Numbers, with an Application to the Entscheidungsproblem\" vorgestellt. Alan Turing beabsichtigte, mit der Turingmaschine ein Modell des mathematisch arbeitenden Menschen zu schaffen. Das Besondere an einer Turingmaschine ist, dass sie mit nur drei Operationen (Lesen, Schreiben und Kopf bewegen) alle Probleme l\u00F6sen kann, die auch von einem Computer gel\u00F6st werden k\u00F6nnen. S\u00E4mtliche mathematischen Grundfunktionen wie Addition und Multiplikation lassen sich mit diesen drei Operationen simulieren. Darauf aufbauend kann man dann komplexe Operationen der \u00FCblichen Computerprogramme simulieren. Eine Funktion, die so durch eine Turingmaschine berechnet werden kann, nennt man eine turingberechenbare Funktion. Die Church-Turing-These stellt die Behauptung auf, dass eine Turingmaschine gerade die von Menschen berechenbaren mathematischen Funktionen l\u00F6sen kann. Daraus darf jedoch nicht gefolgert werden, dass eine Turingmaschine alle mathematischen Funktionen l\u00F6sen kann. So kann etwa anhand des Halteproblems gezeigt werden, dass es mathematische Funktionen gibt, die nicht von Turingmaschinen (und daher gem\u00E4\u00DF Church-Turing-These auch nicht von Menschen) berechnet werden k\u00F6nnen."@de , "A Turing-g\u00E9p fogalm\u00E1t Alan Turing angol matematikus dolgozta ki 1936-ban megjelent cikk\u00E9ben a matematikai sz\u00E1m\u00EDt\u00E1si elj\u00E1r\u00E1sok, algoritmusok prec\u00EDz le\u00EDr\u00E1s\u00E1ra, t\u00E1gabb \u00E9rtelemben pedig mindenfajta \u201Eg\u00E9pies\u201D probl\u00E9mamegold\u00F3 folyamat, p\u00E9ld\u00E1ul az akkoriban m\u00E9g nem l\u00E9tez\u0151 sz\u00E1m\u00EDt\u00F3g\u00E9pek m\u0171k\u00F6d\u00E9s\u00E9nek modellez\u00E9s\u00E9re. Erre az id\u0151szakra, a II. vil\u00E1gh\u00E1bor\u00FA k\u00F6rny\u00E9k\u00E9re tehet\u0151 az ilyesfajta, a sz\u00E1m\u00EDt\u00E1si elj\u00E1r\u00E1sokat azok k\u00FCl\u00F6nf\u00E9le modelljein kereszt\u00FCl vizsg\u00E1l\u00F3 kutat\u00E1sok fellend\u00FCl\u00E9se, melyek v\u00E9g\u00FCl a val\u00F3di sz\u00E1m\u00EDt\u00F3g\u00E9pek \u00E9p\u00EDt\u00E9s\u00E9be torkollottak (Turing maga is r\u00E9szt vett egy val\u00F3di g\u00E9p, a Colossus meg\u00E9p\u00EDt\u00E9s\u00E9ben). A Turing-g\u00E9p \u00FAgynevezett absztrakt automata: a val\u00F3s\u00E1gos digit\u00E1lis sz\u00E1m\u00EDt\u00F3g\u00E9pek nagyon leegyszer\u0171s\u00EDtett modellje (r\u00E9szletesebben ld. k\u00F6vetkez\u0151 fejezet). Tov\u00E1bbi jelent\u0151s\u00E9g\u00E9t az \u00FAn. Church-Turing-t\u00E9zis adja, amely szerint univerz\u00E1lis algoritmikus modell. Az ilyen egyszer\u0171 sz\u00E1m\u00EDt\u00F3g\u00E9pmodellek matematiz\u00E1lt elm\u00E9leteivel a matematika sz\u00E1m\u00EDt\u00F3g\u00E9p-tudom\u00E1nynak nevezett el\u00E9gg\u00E9 fiatal tudom\u00E1ny\u00E1g\u00E1nak olyan r\u00E9szter\u00FCletei foglalkoznak, mint p\u00E9ld\u00E1ul a sz\u00E1m\u00EDt\u00E1selm\u00E9let."@hu , "Turing makinesi, Karma\u015F\u0131k matematiksel hesaplar\u0131n belirli bir d\u00FCzenek taraf\u0131ndan yap\u0131lmas\u0131n\u0131 sa\u011Flayan hesap makinesi. Karma\u015F\u0131k hesaplar\u0131n belirli bir d\u00FCzenek taraf\u0131ndan yap\u0131l\u0131p yap\u0131lanamayaca\u011F\u0131 20. yy\u2019\u0131n ba\u015Flar\u0131nda b\u00FCy\u00FCk bir tart\u0131\u015Fma konusu olmu\u015Ftu. \u00D6teden beri el ile veya zihinden yap\u0131lan hesaplamalar \u00E7ok zaman almakla birlikte, bir\u00E7ok hatay\u0131 da beraberinde getiriyordu. T\u00FCm bu tart\u0131\u015Fmalar s\u00FCrerken, 1936 y\u0131l\u0131nda, \u00FCnl\u00FC matematik\u00E7i Alan M. Turing \"Saptama Problemi Hakk\u0131nda Bir Uygulamayla Birlikte Hesaplanabilir Say\u0131lar\" (\u0130ngilizce On computable numbers, with an application to the Entscheidungsproblem) isimli bir makalesini yay\u0131nlad\u0131. Makalesinde teorik ve matematiksel temellere dayal\u0131 sanal bir makineden bahseden Turing, her t\u00FCrl\u00FC matematiksel hesab\u0131n bu sanal makineyle yap\u0131labilece\u011Fini iddia ediyordu. Turing\u2019in 1950 y\u0131l\u0131nda yay\u0131nlanan \"Hesaplama Mekanizmas\u0131 ve Zeka\" (\u0130ngilizce Computing Machinery and Intelligence) isimli ikinci makalesi ise, makineler ve zekayla ilgili bir\u00E7ok tart\u0131\u015Fmal\u0131 konuya cevap niteli\u011Findeydi. \u0130\u015Fte bu makalelerde s\u00F6z\u00FC ge\u00E7en sanal makine daha sonralar\u0131 Turing Makinesi (\u0130ngilizce The Turing Machine) olarak isimlendirildi. Bu tablo, o Turing makinesinin \u00E7al\u0131\u015Ft\u0131rd\u0131\u011F\u0131 algoritmad\u0131r. Turing makinesi, her ad\u0131mda: O anda kafan\u0131n g\u00F6rmekte oldu\u011Fu sembol\u00FC okur. Ge\u00E7i\u015F tablosunda okudu\u011Fu sembol ve o anki durumunu i\u00E7eren bir girdi arar: E\u011Fer \u00F6yle bir girdi bulursa, yaz\u0131lacak sembol\u00FC yazar veya kafas\u0131n\u0131 hareket ettirir ve yeni duruma ge\u00E7er. Makine, yeni durum ve kafan\u0131n okudu\u011Fu yeni sembol ile \u00E7al\u0131\u015Fmaya devam edecektir. E\u011Fer \u00F6yle bir girdi bulamaz ise, durur."@tr , "A m\u00E1quina de Turing \u00E9 um dispositivo te\u00F3rico, conhecido como m\u00E1quina universal, que foi concebido pelo matem\u00E1tico brit\u00E2nico Alan Turing, muitos anos antes de existirem os modernos computadores digitais (o artigo de refer\u00EAncia foi publicado em 1936). Num sentido preciso, \u00E9 um modelo abstrato de um computador, que se restringe apenas aos aspectos l\u00F3gicos do seu funcionamento (mem\u00F3ria, estados e transi\u00E7\u00F5es) e n\u00E3o \u00E0 sua implementa\u00E7\u00E3o f\u00EDsica. Numa m\u00E1quina de Turing pode-se modelar qualquer computador digital. Turing tamb\u00E9m se envolveu na constru\u00E7\u00E3o de m\u00E1quinas f\u00EDsicas para quebrar os c\u00F3digos secretos das comunica\u00E7\u00F5es alem\u00E3s durante a II Guerra Mundial, tendo utilizado alguns dos conceitos te\u00F3ricos desenvolvidos para o seu modelo de computador universal."@pt , "Turing\u016Fv stroj (TS) je teoretick\u00FD model po\u010D\u00EDta\u010De popsan\u00FD matematikem Alanem Turingem. Skl\u00E1d\u00E1 se z procesorov\u00E9 jednotky, tvo\u0159en\u00E9 kone\u010Dn\u00FDm automatem, programu ve tvaru pravidel p\u0159echodov\u00E9 funkce a pravostrann\u011B nekone\u010Dn\u00E9 p\u00E1sky pro z\u00E1pis meziv\u00FDsledk\u016F. Vyu\u017E\u00EDv\u00E1 se pro modelov\u00E1n\u00ED algoritm\u016F v teorii vy\u010D\u00EDslitelnosti. Jeden ze zp\u016Fsobu vyj\u00E1d\u0159en\u00ED Church-Turingovy teze \u0159\u00EDk\u00E1, \u017Ee ke ka\u017Ed\u00E9mu algoritmu existuje ekvivalentn\u00ED Turing\u016Fv stroj."@cs , "En turingmaskin er en tenkt, formelt beskrevet maskin som utf\u00F8rer ordre etter en helt bestemt oppskrift eller en tabell. Maskinen er en idealisert og formell beskrivelse av en datamaskin, og hvilke beregninger eller oppgaver en datamaskin kan utf\u00F8re. Maskinen er idealisert i den forstand at den har uendelig stor lagringsplass, og den gj\u00F8r aldri feil p\u00E5 grunn av sine fysiske mekanismer. Det var Alan Turing som f\u00F8rst beskrev en slik maskin i sin avhandling On Computable Numbers i 1936. En turingmaskin best\u00E5r av et lese/skrive-hode som kan lese/skrive tegn fra/til ruter p\u00E5 en papirstrimmel. Maskinen har mange, men et endelig antall tilstander som beskriver hva som skal gj\u00F8res n\u00E5r et bestemt tegn leses. For hvert tegn som leses, gj\u00F8res to ting: maskinen skriver eventuelt et nytt tegn til strimmelen, og endrer tilstanden. Maskinen har en start-tilstand og en slutt-tilstand. \u00ABResultatet\u00BB av beregningene st\u00E5r til slutt p\u00E5 strimmelen. Alan Turing brukte en formell beskrivelse av en slik maskin for \u00E5 bevise setninger innen matematikken. Siden har interessen rundt hans abstrakte maskiner (de ble f\u00F8rst senere kalt turingmaskiner) vokst i forbindelse med fremveksten av datamaskiner, og hva datamaskiner egentlig kan utf\u00F8re av beregninger. Det ser ut til at ingen maskin kan v\u00E6re «kraftigere» enn en turingmaskin i den forstand at den kan utf\u00F8re andre oppgaver som turingmaskinen ikke klarer. Turing, A.M. (1936), \"On Computable Numbers, with an Application to the Entscheidungsproblem \", Proceedings of the London Mathematical Society, 2 42: 230\u201365, 1937 . Reprinted in many collections, e.g. in The Undecidable pp.115\u2013154; available on the web in many places, e.g. at Scribd."@no , "Maszyna Turinga - stworzony przez Alana Turinga abstrakcyjny model komputera s\u0142u\u017C\u0105cy do wykonywania algorytm\u00F3w. Ka\u017Cdy algorytm wyra\u017Calny na maszynie Turinga mo\u017Cna wyrazi\u0107 w rachunku lambda i odwrotnie. Poniewa\u017C jednak maszyny Turinga rozszerza si\u0119 bardzo trudno, za\u015B rachunek lambda bardzo \u0142atwo, w praktyce s\u0105 one o wiele mniej popularne jako rzeczywiste modele oblicze\u0144. S\u0105 za to u\u017Cywane cz\u0119sto do udowadniania nierozstrzygalno\u015Bci r\u00F3\u017Cnych problem\u00F3w. Maszyna Turinga sk\u0142ada si\u0119 z niesko\u0144czenie d\u0142ugiej ta\u015Bmy podzielonej na pola. Ta\u015Bma mo\u017Ce by\u0107 niesko\u0144czona jednostronnie lub obustronnie. Ka\u017Cde pole mo\u017Ce znajdowa\u0107 si\u0119 w jednym z N stan\u00F3w. Maszyna zawsze jest ustawiona nad jednym z p\u00F3l i znajduje si\u0119 w jednym z M stan\u00F3w. Zale\u017Cnie od kombinacji stanu maszyny i pola maszyna zapisuje now\u0105 warto\u015B\u0107 w polu, zmienia stan, a nast\u0119pnie mo\u017Ce przesun\u0105\u0107 si\u0119 o jedno pole w prawo lub w lewo. Taka operacja nazywana jest rozkazem. Maszyna Turinga jest sterowana list\u0105 zawieraj\u0105c\u0105 dowoln\u0105 ilo\u015B\u0107 takich rozkaz\u00F3w. Liczby N i M mog\u0105 by\u0107 dowolne, byle sko\u0144czone. Czasem dopuszcza si\u0119 te\u017C stan M+1, kt\u00F3ry oznacza zako\u0144czenie pracy maszyny. Lista rozkaz\u00F3w dla maszyny Turinga mo\u017Ce by\u0107 traktowana jako jej program. Maszyna Turinga A posiadaj\u0105ca zdolno\u015B\u0107 symulacji dzia\u0142ania dowolnej innej maszyny Turinga B (opisanej jako dane wej\u015Bciowe dla maszyny A) na dowolnych danych wej\u015Bciowych dla maszyny B, nazywana jest uniwersaln\u0105 maszyna Turinga. Praktycznym przybli\u017Ceniem realizacji uniwersalnej Maszyny Turinga jest komputer, b\u0119d\u0105cy w stanie wykona\u0107 dowolny program na dowolnych danych. Nale\u017Cy podkre\u015Bli\u0107, \u017Ce komputery nie s\u0105 uniwersalnymi maszynami Turinga w sensie pierwotnej definicji, poniewa\u017C ilo\u015B\u0107 danych, kt\u00F3re mog\u0105 przechowywa\u0107 i przetwarza\u0107 jest sko\u0144czona, tak wi\u0119c dla ka\u017Cdego komputera istnieje tylko sko\u0144czona ilo\u015B\u0107 program\u00F3w, kt\u00F3re mo\u017Ce wykona\u0107. Mimo \u017Ce ilo\u015B\u0107 ta jest niewyobra\u017Calnie wielka i w praktyce cz\u0119sto wystarczaj\u0105ca, to bez wzgl\u0119du na rozmiar pami\u0119ci, zawsze b\u0119dzie istnie\u0107 program, kt\u00F3rego maszyna nie b\u0119dzie w stanie wykona\u0107, poniewa\u017C jego kod (opis) po prostu nie mie\u015Bci si\u0119 w tej pami\u0119ci. Mo\u017Cna rozwa\u017Ca\u0107 bardzo wiele r\u00F3\u017Cnych wariant\u00F3w maszyny Turinga. Na przyk\u0142ad nie ma potrzeby pozwala\u0107 na pozostanie maszyny na tym samym polu, poniewa\u017C maszyna musi albo zako\u0144czy\u0107 obliczenia przez zap\u0119tlenie, albo po nie wi\u0119cej ni\u017C N*M krokach dane pole opu\u015Bci\u0107 i wystarczy wtedy przyj\u0105\u0107 dla danej kombinacji pocz\u0105tkowej stany podczas opuszczania pola. Istniej\u0105 te\u017C maszyny Turinga wielota\u015Bmowe lub niedeterministyczne (gdzie jednej parze mo\u017Ce odpowiada\u0107 kilka instrukcji) oraz wielowymiarowe (prost\u0105 dwuwymiarow\u0105 maszyn\u0105 Turinga jest mr\u00F3wka Langtona). W informatyce dowodzi si\u0119 r\u00F3wnowa\u017Cno\u015Bci wielu r\u00F3\u017Cnych wariant\u00F3w maszyny Turinga. Np. do\u015B\u0107 \u0142atwo jest pokaza\u0107, \u017Ce maszyna Turinga z wieloma ta\u015Bmami nie r\u00F3\u017Cni si\u0119 istotnie od klasycznej maszyny jednota\u015Bmowej. R\u00F3wnie\u017C niedeterministyczne maszyny Turinga s\u0105 r\u00F3wnowa\u017Cne deterministycznym. Rozwa\u017Cania na temat mocy obliczeniowej niedeterministycznych maszyn Turinga s\u0105 podstaw\u0105 centralnego problemu teorii z\u0142o\u017Cono\u015Bci obliczeniowej \u2013 \"P versus NP\". Mimo \u017Ce maszyna Turinga jest abstrakcj\u0105 o du\u017Cej mocy obliczeniowej (wi\u0119kszej na przyk\u0142ad ni\u017C dowolny komputer), istnieje wiele problem\u00F3w, kt\u00F3rych nie da si\u0119 na niej rozwi\u0105za\u0107. Matematycy rozwa\u017Caj\u0105 wi\u0119c (od czas\u00F3w samego Turinga) silniejsze modele oblicze\u0144, kt\u00F3re mog\u0105 takim zadaniom podo\u0142a\u0107. Hipotetyczne maszyny potrafi\u0105ce wykonywa\u0107 takie obliczenia, nazywa si\u0119 hiperkomputerami. Nale\u017Cy zauwa\u017Cy\u0107, \u017Ce przy obecnym stanie wiedzy nie jest jasne, czy prawa fizyki rz\u0105dz\u0105ce naszym \u015Bwiatem pozwalaj\u0105 na skonstruowanie maszyn obliczeniowych silniejszych ni\u017C maszyna Turinga. Jest to pole aktywnych prac badawczych."@pl , "En Turingmaskin \u00E4r en abstrakt mekanism, en teoretisk modell, f\u00F6r att utf\u00F6ra ber\u00E4kningar, som utvecklades av Alan Turing \u00E5r 1936. Turingmaskinen konstruerades till den enklast m\u00F6jliga mekanismen som \u00E4r kapabel att utf\u00F6ra icke-triviala ber\u00E4kningar, och spelar en central roll i teorierna f\u00F6r ber\u00E4kningsbarhet och ber\u00E4kningskomplexitet, samt allm\u00E4nt inom den matematiska logiken. En Turingmaskin kan konstrueras f\u00F6r att l\u00F6sa ett givet problem (en specifik turingmaskin), men det g\u00E5r ocks\u00E5 att konstruera en universell turingmaskin som \u00E4r kapabel att l\u00E4sa en kodad beskrivning av en specifik turingmaskin med dess indata, och sedan utf\u00F6ra denna maskins ber\u00E4kning. Church-Turings hypotes s\u00E4ger att varje t\u00E4nkbar ber\u00E4kningsprocess kan utf\u00F6ras av en Turingmaskin, och allts\u00E5 att det rent principiellt inte finns n\u00E5gon mer kraftfull ber\u00E4kningsmekanism. Denna tes \u00E4r inte i strikt matematisk mening bevisad, men allm\u00E4nt accepterad som Sanningsann. Argument som talar f\u00F6r tesen \u00E4r bland andra att andra f\u00F6rs\u00F6k till teoretiska modeller av ber\u00E4kningsprocesser, som till exempel Churchs lambdakalkyl, rekursionsteori och post-maskiner, kan visas vara ekvivalenta med turingmaskiner. Alla dagens datorer kan ocks\u00E5 betraktas som turingmaskiner: de kan med andra ord simuleras av en s\u00E5dan. Teorierna om turingmaskiner fick stor betydelse f\u00F6r konstruktionerna av de f\u00F6rsta datorerna, till exempel Z3 ."@sv , "Turing machines are basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer algorithm. They were described in 1936 by Alan Turing. Turing machines are not intended as a practical computing technology, but a thought experiment about the limits of mechanical computation. Thus they were not actually constructed. A succinct definition of the thought experiment was given by Turing in his 1948 essay, \"Intelligent Machinery\". Referring back to his 1936 publication, Turing writes that the Turing machine, here called a Logical Computing Machine, consisted of: ... \"an infinite memory capacity obtained in the form of an infinite tape marked out into squares on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter the scanned symbol and its behavior is in part determined by that symbol, but the symbols on the tape elsewhere do not affect the behavior of the machine. However, the tape can be moved back and forth through the machine, this being one of the elementary operations of the machine. Any symbol on the tape may therefore eventually have an innings. \" (Turing 1948, p. 61) A Turing machine that is able to simulate any other Turing machine is called a Universal Turing machine (UTM, or simply a universal machine). A more mathematically-oriented definition with a similar \"universal\" nature was introduced by Alonzo Church, whose work on lambda calculus intertwined with Turing's in a formal theory of computation known as the Church–Turing thesis. The thesis states that Turing machines indeed capture the informal notion of effective method in logic and mathematics, and provide a precise definition of an algorithm or 'mechanical procedure'. Studying their abstract properties yields many insights into computer science and complexity theory."@en , "In de informatica is de Turingmachine een model van berekening en berekenbaarheid, ontwikkeld door de wiskundige Alan M. Turing in zijn beroemde artikel \"On computable numbers, with an application to the Entscheidungsproblem\" uit 1936-37. De Turingmachine is een uiterst eenvoudig mechanisme dat symbolen manipuleert en ondanks deze eenvoud kan men hiermee de logica van elke mogelijke computer simuleren. Hoewel ze technisch realiseerbaar zijn (zij het met eindige band, onderverdeeld in eindig veel vakjes - dit is nauwelijks een Turingmachine meer), zijn ze niet bedoeld voor praktische computertechnologie maar als een gedachte-experiment rond de limieten van mechanische berekeningen; ze worden dus niet echt gebouwd."@nl , "La m\u00E0quina de Turing \u00E9s un model computacional introdu\u00EFt per Alan Turing en el treball \"On computable numbers, with an application to the Entscheidungsproblem\", publicat per la Societat Matem\u00E0tica de Londres, en el qual s'estudiava la q\u00FCesti\u00F3 plantejada per David Hilbert sobre si les matem\u00E0tiques s\u00F3n decidibles, \u00E9s a dir, si hi ha un m\u00E8tode definit que pugui aplicar-se a qualsevol sent\u00E8ncia matem\u00E0tica i que ens digui si \u00E9s certa o no. Turing va construir un model formal de computador, la m\u00E0quina de Turing, i va demostrar que existien problemes que una m\u00E0quina no podia resoldre. La m\u00E0quina de Turing \u00E9s un model matem\u00E0tic abstracte que formalitza el concepte d'algoritme."@ca , "Une machine de Turing est un mod\u00E8le abstrait du fonctionnement des appareils m\u00E9caniques de calcul, tel un ordinateur et sa m\u00E9moire, cr\u00E9\u00E9 par Alan Turing en vue de donner une d\u00E9finition pr\u00E9cise au concept d'Algorithmiquealgorithme ou \u00AB proc\u00E9dure m\u00E9canique \u00BB. Ce mod\u00E8le est toujours largement utilis\u00E9 en informatique th\u00E9orique, en particulier pour r\u00E9soudre les probl\u00E8mes de complexit\u00E9 algorithmique et de calculabilit\u00E9, on lui adjoint pour cela un oracle (machine de Turing)oracle. La Th\u00E8se Church-Turingth\u00E8se Church-Turing postule que tout probl\u00E8me de calcul fond\u00E9 sur une proc\u00E9dure algorithmique peut \u00EAtre r\u00E9solu par une machine de Turing. Cette th\u00E8se n'est pas un \u00E9nonc\u00E9 math\u00E9matique, puisqu'elle ne suppose pas une d\u00E9finition pr\u00E9cise de proc\u00E9dure algorithmique. En revanche, il est possible de d\u00E9finir une notion de \u00AB syst\u00E8me acceptable de programmation \u00BB et de d\u00E9montrer que le pouvoir de tels syst\u00E8mes est \u00E9quivalent \u00E0 celui des machines de Turing. \u00C0 l'origine, le concept de machine de Turing, invent\u00E9 avant l'ordinateur, \u00E9tait cens\u00E9 repr\u00E9senter une personne virtuelle ex\u00E9cutant une proc\u00E9dure bien d\u00E9finie, en changeant le contenu des cases d'un tableau infini, en choisissant ce contenu parmi un ensemble fini de symboles. D'autre part, la personne doit m\u00E9moriser un \u00E9tat particulier parmi un ensemble fini d'\u00E9tats. La proc\u00E9dure est formul\u00E9e en termes d'\u00E9tapes tr\u00E8s simples, du type : \u00AB si vous \u00EAtes dans l'\u00E9tat 42 et que le symbole contenu sur la case que vous regardez est '0', alors remplacer ce symbole par un '1', passer dans l'\u00E9tat 17, et regarder une case (droite ou gauche) \u00BB."@fr ; rdfs:comment "Turing machines are basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer algorithm. They were described in 1936 by Alan Turing. Turing machines are not intended as a practical computing technology, but a thought experiment about the limits of mechanical computation. Thus they were not actually constructed. A succinct definition of the thought experiment was given by Turing in his 1948 essay, \"Intelligent Machinery\"."@en , "En Turingmaskin \u00E4r en abstrakt mekanism, en teoretisk modell, f\u00F6r att utf\u00F6ra ber\u00E4kningar, som utvecklades av Alan Turing \u00E5r 1936. Turingmaskinen konstruerades till den enklast m\u00F6jliga mekanismen som \u00E4r kapabel att utf\u00F6ra icke-triviala ber\u00E4kningar, och spelar en central roll i teorierna f\u00F6r ber\u00E4kningsbarhet och ber\u00E4kningskomplexitet, samt allm\u00E4nt inom den matematiska logiken."@sv , "\u041C\u0430\u0448\u0438\u0301\u043D\u0430 \u0422\u044C\u044E\u0301\u0440\u0438\u043D\u0433\u0430 (\u041C\u0422) \u2014 \u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u044B\u0439 \u0438\u0441\u043F\u043E\u043B\u043D\u0438\u0442\u0435\u043B\u044C (\u0430\u0431\u0441\u0442\u0440\u0430\u043A\u0442\u043D\u0430\u044F \u0432\u044B\u0447\u0438\u0441\u043B\u0438\u0442\u0435\u043B\u044C\u043D\u0430\u044F \u043C\u0430\u0448\u0438\u043D\u0430). \u0411\u044B\u043B\u0430 \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u0430 \u0410\u043B\u0430\u043D\u043E\u043C \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u043E\u043C \u0432 1936 \u0433\u043E\u0434\u0443 \u0434\u043B\u044F \u0444\u043E\u0440\u043C\u0430\u043B\u0438\u0437\u0430\u0446\u0438\u0438 \u043F\u043E\u043D\u044F\u0442\u0438\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0430."@ru , "\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3 \u306F\u8A08\u7B97\u6A21\u578B\u306E\u3072\u3068\u3064\u3002\u3059\u306A\u308F\u3061\u3001\u8A08\u7B97\u6A5F\u3092\u6570\u5B66\u7684\u306B\u8B70\u8AD6\u3059\u308B\u305F\u3081\u306E\u3001\u5358\u7D14\u5316\u30FB\u7406\u60F3\u5316\u3055\u308C\u305F\u4EEE\u60F3\u6A5F\u68B0\u3067\u3042\u308B\u3002"@ja , "\u041C\u0430\u0448\u0438\u0301\u043D\u0430 \u0422\u044E\u0301\u0440\u0438\u043D\u0433\u0430 \u2014 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0435 \u043F\u043E\u043D\u044F\u0442\u0442\u044F, \u0432\u0432\u0435\u0434\u0435\u043D\u0435 \u0434\u043B\u044F \u0444\u043E\u0440\u043C\u0430\u043B\u044C\u043D\u043E\u0433\u043E \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u043D\u044F \u0456\u043D\u0442\u0443\u0456\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443. \u041D\u0430\u0437\u0432\u0430\u043D\u0430 \u043D\u0430 \u0447\u0435\u0441\u0442\u044C \u0430\u043D\u0433\u043B\u0456\u0439\u0441\u044C\u043A\u043E\u0433\u043E \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A\u0430 \u0410\u043B\u0430\u043D\u0430 \u0422\u044E\u0440\u0438\u043D\u0433\u0430, \u044F\u043A\u0438\u0439 \u0437\u0430\u043F\u0440\u043E\u043F\u043E\u043D\u0443\u0432\u0430\u0432 \u0446\u0435 \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0443 1936."@uk , "Die Turingmaschine ist ein von dem britischen Mathematiker Alan Turing 1936 entwickeltes Modell, um eine Klasse von berechenbaren Funktionen zu bilden. Sie geh\u00F6rt zu den grundlegenden Konzepten der Informatik. Das Modell wurde im Rahmen des von David Hilbert im Jahr 1920 formulierten Hilbertprogramms, speziell zur L\u00F6sung des so genannten Entscheidungsproblems, in der Schrift \"On Computable Numbers, with an Application to the Entscheidungsproblem\" vorgestellt."@de , "Ma\u015Finile Turing sunt ni\u015Fte mecanisme extrem de elementare de dispozitive de prelucrare a simbolurilor care \u2014 \u00EEn ciuda simplit\u0103\u0163ii lor \u2014 pot fi adaptate pentru a simula logica oric\u0103rui calculator ce poate fi construit. Modelele au fost descrise \u00EEn 1936 de c\u0103tre Alan Turing."@ro , "In de informatica is de Turingmachine een model van berekening en berekenbaarheid, ontwikkeld door de wiskundige Alan M. Turing in zijn beroemde artikel \"On computable numbers, with an application to the Entscheidungsproblem\" uit 1936-37. De Turingmachine is een uiterst eenvoudig mechanisme dat symbolen manipuleert en ondanks deze eenvoud kan men hiermee de logica van elke mogelijke computer simuleren."@nl , "Turingin kone on teoreettinen malli sille miten tietokone toimii. Mallin kehitti matemaatikko Alan Turing vuonna 1936 m\u00E4\u00E4ritell\u00E4kseen tarkasti k\u00E4sitteen algoritmi. Turingin kone muistuttaa varhaista mekaanista tietokonetta, vaikkakaan yht\u00E4\u00E4n ohjelmoitavaa tietokonetta ei viel\u00E4 ollut sen keksimishetkell\u00E4 rakennettu. Turingin kone on tarkoitettu algoritmisen ratkaisun mahdollisuuksien rajojen tarkkailuun."@fi , "Una macchina di Turing (termine spesso abbreviato con MdT) \u00E8 una macchina formale, cio\u00E8 un sistema formale che pu\u00F2 descriversi come un meccanismo ideale, ma in linea di principio realizzabile concretamente, che pu\u00F2 trovarsi in stati ben determinati, opera su stringhe in base a regole ben precise e costituisce un modello di calcolo."@it , "La m\u00E0quina de Turing \u00E9s un model computacional introdu\u00EFt per Alan Turing en el treball \"On computable numbers, with an application to the Entscheidungsproblem\", publicat per la Societat Matem\u00E0tica de Londres, en el qual s'estudiava la q\u00FCesti\u00F3 plantejada per David Hilbert sobre si les matem\u00E0tiques s\u00F3n decidibles, \u00E9s a dir, si hi ha un m\u00E8tode definit que pugui aplicar-se a qualsevol sent\u00E8ncia matem\u00E0tica i que ens digui si \u00E9s certa o no."@ca , "La m\u00E1quina de Turing es un modelo computacional introducido por Alan Turing en el trabajo \u201COn computable numbers, with an application to the Entscheidungsproblem\u201D, publicado por la Sociedad Matem\u00E1tica de Londres en 1936, en el cual se estudiaba la cuesti\u00F3n planteada por David Hilbert sobre si las matem\u00E1ticas son decidibles, es decir, si hay un m\u00E9todo definido que pueda aplicarse a cualquier sentencia matem\u00E1tica y que nos diga si esa sentencia es cierta o no."@es , "En turingmaskin er en tenkt, formelt beskrevet maskin som utf\u00F8rer ordre etter en helt bestemt oppskrift eller en tabell. Maskinen er en idealisert og formell beskrivelse av en datamaskin, og hvilke beregninger eller oppgaver en datamaskin kan utf\u00F8re. Maskinen er idealisert i den forstand at den har uendelig stor lagringsplass, og den gj\u00F8r aldri feil p\u00E5 grunn av sine fysiske mekanismer. Det var Alan Turing som f\u00F8rst beskrev en slik maskin i sin avhandling On Computable Numbers i 1936."@no , "Maszyna Turinga - stworzony przez Alana Turinga abstrakcyjny model komputera s\u0142u\u017C\u0105cy do wykonywania algorytm\u00F3w. Ka\u017Cdy algorytm wyra\u017Calny na maszynie Turinga mo\u017Cna wyrazi\u0107 w rachunku lambda i odwrotnie. Poniewa\u017C jednak maszyny Turinga rozszerza si\u0119 bardzo trudno, za\u015B rachunek lambda bardzo \u0142atwo, w praktyce s\u0105 one o wiele mniej popularne jako rzeczywiste modele oblicze\u0144. S\u0105 za to u\u017Cywane cz\u0119sto do udowadniania nierozstrzygalno\u015Bci r\u00F3\u017Cnych problem\u00F3w."@pl , "\u56FE\u7075\u673A\uFF08\u82F1\u8BED\uFF1ATuring Machine\uFF0C\u53C8\u79F0\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF09\u662F\u82F1\u56FD\u6570\u5B66\u5BB6\u963F\u5170\u00B7\u56FE\u7075\u4E8E1936\u5E74\u63D0\u51FA\u7684\u4E00\u79CD\u62BD\u8C61\u8BA1\u7B97\u6A21\u578B\uFF0C\u5176\u66F4\u62BD\u8C61\u7684\u610F\u4E49\u4E3A\u4E00\u79CD\u6570\u5B66\u903B\u8F91\u673A\uFF0C\u53EF\u4EE5\u770B\u4F5C\u7B49\u4EF7\u4E8E\u4EFB\u4F55\u6709\u9650\u903B\u8F91\u6570\u5B66\u8FC7\u7A0B\u7684\u7EC8\u6781\u5F3A\u5927\u903B\u8F91\u673A\u5668\u3002"@zh , "A Turing-g\u00E9p fogalm\u00E1t Alan Turing angol matematikus dolgozta ki 1936-ban megjelent cikk\u00E9ben a matematikai sz\u00E1m\u00EDt\u00E1si elj\u00E1r\u00E1sok, algoritmusok prec\u00EDz le\u00EDr\u00E1s\u00E1ra, t\u00E1gabb \u00E9rtelemben pedig mindenfajta \u201Eg\u00E9pies\u201D probl\u00E9mamegold\u00F3 folyamat, p\u00E9ld\u00E1ul az akkoriban m\u00E9g nem l\u00E9tez\u0151 sz\u00E1m\u00EDt\u00F3g\u00E9pek m\u0171k\u00F6d\u00E9s\u00E9nek modellez\u00E9s\u00E9re. Erre az id\u0151szakra, a II."@hu , "A m\u00E1quina de Turing \u00E9 um dispositivo te\u00F3rico, conhecido como m\u00E1quina universal, que foi concebido pelo matem\u00E1tico brit\u00E2nico Alan Turing, muitos anos antes de existirem os modernos computadores digitais (o artigo de refer\u00EAncia foi publicado em 1936). Num sentido preciso, \u00E9 um modelo abstrato de um computador, que se restringe apenas aos aspectos l\u00F3gicos do seu funcionamento (mem\u00F3ria, estados e transi\u00E7\u00F5es) e n\u00E3o \u00E0 sua implementa\u00E7\u00E3o f\u00EDsica."@pt , "Turing makinesi, Karma\u015F\u0131k matematiksel hesaplar\u0131n belirli bir d\u00FCzenek taraf\u0131ndan yap\u0131lmas\u0131n\u0131 sa\u011Flayan hesap makinesi. Karma\u015F\u0131k hesaplar\u0131n belirli bir d\u00FCzenek taraf\u0131ndan yap\u0131l\u0131p yap\u0131lanamayaca\u011F\u0131 20. yy\u2019\u0131n ba\u015Flar\u0131nda b\u00FCy\u00FCk bir tart\u0131\u015Fma konusu olmu\u015Ftu. \u00D6teden beri el ile veya zihinden yap\u0131lan hesaplamalar \u00E7ok zaman almakla birlikte, bir\u00E7ok hatay\u0131 da beraberinde getiriyordu. T\u00FCm bu tart\u0131\u015Fmalar s\u00FCrerken, 1936 y\u0131l\u0131nda, \u00FCnl\u00FC matematik\u00E7i Alan M."@tr , "Turing\u016Fv stroj (TS) je teoretick\u00FD model po\u010D\u00EDta\u010De popsan\u00FD matematikem Alanem Turingem. Skl\u00E1d\u00E1 se z procesorov\u00E9 jednotky, tvo\u0159en\u00E9 kone\u010Dn\u00FDm automatem, programu ve tvaru pravidel p\u0159echodov\u00E9 funkce a pravostrann\u011B nekone\u010Dn\u00E9 p\u00E1sky pro z\u00E1pis meziv\u00FDsledk\u016F. Vyu\u017E\u00EDv\u00E1 se pro modelov\u00E1n\u00ED algoritm\u016F v teorii vy\u010D\u00EDslitelnosti. Jeden ze zp\u016Fsobu vyj\u00E1d\u0159en\u00ED Church-Turingovy teze \u0159\u00EDk\u00E1, \u017Ee ke ka\u017Ed\u00E9mu algoritmu existuje ekvivalentn\u00ED Turing\u016Fv stroj."@cs , "Une machine de Turing est un mod\u00E8le abstrait du fonctionnement des appareils m\u00E9caniques de calcul, tel un ordinateur et sa m\u00E9moire, cr\u00E9\u00E9 par Alan Turing en vue de donner une d\u00E9finition pr\u00E9cise au concept d'Algorithmiquealgorithme ou \u00AB proc\u00E9dure m\u00E9canique \u00BB. Ce mod\u00E8le est toujours largement utilis\u00E9 en informatique th\u00E9orique, en particulier pour r\u00E9soudre les probl\u00E8mes de complexit\u00E9 algorithmique et de calculabilit\u00E9, on lui adjoint pour cela un oracle (machine de Turing)oracle."@fr ; foaf:depiction . @prefix skos: . @prefix ns11: . dbpedia:Turing_machine skos:subject ns11:Computational_models , ns11:Theoretical_computer_science , ns11:Formal_methods , ns11:Educational_abstract_machines , ns11:Alan_Turing , ns11:English_inventions , ns11:Recursion_theory . @prefix ns12: . dbpedia:Turing_machine dbpprop:wikiPageUsesTemplate ns12:two_other_uses , ns12:see_also , ns12:dmoz ; dbpprop:seeAlsoProperty "Register machine"@en , "Algorithm"@en , "Post–Turing machine"@en , "Church–Turing thesis"@en , "Turing machine equivalents"@en ; dbpprop:dmozProperty "Computers/Computer_Science/Theoretical/Automata_Theory/Turing_Machines"@en , "Turing Machines"@en . @prefix ns13: . dbpedia:Turing_machine dbpprop:relatedInstance ns13:quote6 , ns13:quote7 , ns13:quote8 , ns13:quote9 , ns13:quote1 , ns13:quote3 , ns13:quote4 , ns13:quote5 , ns13:quote16 , ns13:quote12 , ns13:quote13 , ns13:quote14 , ns13:quote15 , ns13:quote10 , ns13:quote11 ; dbpprop:twoOtherUsesProperty "the instrumental rock band"@en , "Turing test"@en , "Turing Machine (band)"@en , "the test of artificial intelligence"@en . @prefix ns14: . dbpedia:Turing_machine dbpprop:hasPhotoCollection ns14:Turing_machine . dbpprop:disambiguates dbpedia:Turing_machine . dbpedia:Alan_Turing dbpedia-owl:knownFor dbpedia:Turing_machine . @prefix ns15: . dbpedia:Alan_Turing ns15:knownFor dbpedia:Turing_machine ; dbpprop:knownFor dbpedia:Turing_machine . dbpedia:Multitape_turing_machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Deterministic_Turing_machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Multitape_Turing_machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Turing_Machines dbpprop:redirect dbpedia:Turing_machine . dbpedia:Turing_machines dbpprop:redirect dbpedia:Turing_machine . dbpedia:Infinite-time_Turing_machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:K-string_Turing_machine_with_input_and_output dbpprop:redirect dbpedia:Turing_machine . dbpedia:Multi-string_Turing_machine_with_input_and_output dbpprop:redirect dbpedia:Turing_machine . dbpedia:Turing_Machine_simulator dbpprop:redirect dbpedia:Turing_machine . dbpedia:Universal_Machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Universal_machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Turing_Machine dbpprop:redirect dbpedia:Turing_machine . dbpedia:Universal_computation dbpprop:redirect dbpedia:Turing_machine . dbpedia:Universal_computer dbpprop:redirect dbpedia:Turing_machine . @prefix yago: . yago:Turing_machine owl:sameAs dbpedia:Turing_machine .