@prefix dbpprop: .
@prefix dbpedia: .
dbpedia:Post-Turing_machine dbpprop:redirect .
dbpedia:Post-Turing_Machine dbpprop:redirect .
dbpedia:Post-Turing_program dbpprop:redirect .
@prefix rdf: .
@prefix ns3: .
rdf:type ns3:ProgrammingLanguages ,
ns3:FormalMethods .
@prefix owl: .
owl:sameAs .
@prefix foaf: .
foaf:page .
@prefix rdfs: .
rdfs:label "Post\u2013Turing machine"@en ,
"\u041C\u0430\u0448\u0438\u043D\u0430 \u041F\u043E\u0441\u0442\u0430"@ru ,
"\u6CE2\u65AF\u7279-\u56FE\u7075\u673A"@zh ;
dbpprop:abstract "A Post\u2013Turing machine is a \"program formulation\" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. (Post's model and Turing's model, though very similar to one another, were developed independently. Turing's paper was received for publication in May of 1936, followed by Post's in October. ) A Post-Turing machine uses a binary alphabet, an infinite sequence of binary storage locations, and a primitive programming language with instructions for bi-directional movement among the storage locations and alteration of their contents one at a time. The names \"Post-Turing program\" and \"Post-Turing machine\" were used by Martin Davis in 1973-1974 (Davis 1973, p.69ff). Later in 1980, Davis used the name \"Turing-Post program\" (Davis, in Steen p. 241)."@en ,
"Post-\u56FE\u7075\u673A\u662F\u4E00\u79CD\u7279\u522B\u7B80\u5355\u7C7B\u578B\u7684\u56FE\u7075\u673A\u7684\"\u7A0B\u5E8F\u516C\u5F0F\u5316\"\uFF0C\u7531\u4E0B\u9762\u63CF\u8FF0\u7684 Emil Post \u7684\u56FE\u7075\u7B49\u4EF7\u7684\u8BA1\u7B97\u6A21\u578B\u6784\u6210\u3002(Post \u7684\u6A21\u578B\u548C\u56FE\u7075\u7684\u6A21\u578B\uFF0C\u5C3D\u7BA1\u76F8\u4E92\u4E4B\u95F4\u975E\u5E38\u7C7B\u4F3C\uFF0C\u4F46\u5374\u662F\u72EC\u7ACB\u5F00\u53D1\u7684\u3002\u56FE\u7075\u7684\u8BBA\u6587\u5728 1936 \u5E74\u4E94\u6708\u51FA\u7248\uFF0CPost \u7684\u8BBA\u6587\u5728\u5341\u6708\u51FA\u7248\u3002) Post-\u56FE\u7075\u673A\u4F7F\u7528\u4E8C\u5143\u5B57\u6BCD\u8868\uFF0C\u65E0\u9650\u5E8F\u5217\u7684\u4E8C\u5143\u5B58\u50A8\u4F4D\u7F6E\uFF0C\u548C\u5E26\u6709\u5728\u5B58\u50A8\u4F4D\u7F6E\u4E0A\u53CC\u5411\u79FB\u52A8\u548C\u4E00\u6B21\u4E00\u4E2A\u66F4\u6539\u5176\u5185\u5BB9\u7684\u6307\u4EE4\u7684\u539F\u59CB\u7F16\u7A0B\u8BED\u8A00\u3002\"Post-\u56FE\u7075\u7A0B\u5E8F\"\u548C \"Post-\u56FE\u7075\u673A\"\u7684\u540D\u5B57\u7531 Martin Davis \u5728 1973\u5E74-1974\u5E74\u4F7F\u7528 (Davis 1973, p.69ff)\u3002\u540E\u6765 Davis \u5728 1980 \u5E74\u4F7F\u7528\u540D\u5B57 \"Turing-Post \u7A0B\u5E8F\" (Davis, in Steen p. 241)\u3002"@zh ,
"\u041C\u0430\u0448\u0438\u043D\u0430 \u041F\u043E\u0441\u0442\u0430 (\u041C\u041F) \u2014 \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, \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u043D\u0430\u044F \u042D\u043C\u0438\u043B\u0435\u043C \u041B\u0435\u043E\u043D\u043E\u043C \u041F\u043E\u0441\u0442\u043E\u043C (Emil L. Post), \u043A\u043E\u0442\u043E\u0440\u0430\u044F \u043E\u0442\u043B\u0438\u0447\u0430\u0435\u0442\u0441\u044F \u043E\u0442 \u043C\u0430\u0448\u0438\u043D\u044B \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430 \u0431\u043E\u043B\u044C\u0448\u0435\u0439 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u043E\u0439. \u041E\u0431\u0435 \u043C\u0430\u0448\u0438\u043D\u044B \u00AB\u044D\u043A\u0432\u0438\u0432\u0430\u043B\u0435\u043D\u0442\u043D\u044B\u00BB \u0438 \u0431\u044B\u043B\u0438 \u0441\u043E\u0437\u0434\u0430\u043D\u044B \u0434\u043B\u044F \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u0438\u044F \u043F\u043E\u043D\u044F\u0442\u0438\u044F \u00AB\u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u00BB."@ru ;
rdfs:comment "A Post\u2013Turing machine is a \"program formulation\" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. (Post's model and Turing's model, though very similar to one another, were developed independently. Turing's paper was received for publication in May of 1936, followed by Post's in October."@en ,
""@zh ,
"\u041C\u0430\u0448\u0438\u043D\u0430 \u041F\u043E\u0441\u0442\u0430 (\u041C\u041F) \u2014 \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, \u043F\u0440\u0435\u0434\u043B\u043E\u0436\u0435\u043D\u043D\u0430\u044F \u042D\u043C\u0438\u043B\u0435\u043C \u041B\u0435\u043E\u043D\u043E\u043C \u041F\u043E\u0441\u0442\u043E\u043C (Emil L. Post), \u043A\u043E\u0442\u043E\u0440\u0430\u044F \u043E\u0442\u043B\u0438\u0447\u0430\u0435\u0442\u0441\u044F \u043E\u0442 \u043C\u0430\u0448\u0438\u043D\u044B \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430 \u0431\u043E\u043B\u044C\u0448\u0435\u0439 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u043E\u0439. \u041E\u0431\u0435 \u043C\u0430\u0448\u0438\u043D\u044B \u00AB\u044D\u043A\u0432\u0438\u0432\u0430\u043B\u0435\u043D\u0442\u043D\u044B\u00BB \u0438 \u0431\u044B\u043B\u0438 \u0441\u043E\u0437\u0434\u0430\u043D\u044B \u0434\u043B\u044F \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u0438\u044F \u043F\u043E\u043D\u044F\u0442\u0438\u044F \u00AB\u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u00BB."@ru .
@prefix skos: .
@prefix ns8: .
skos:subject ns8:Computational_models ,
ns8:Recursion_theory .
@prefix ns9: .
dbpprop:wikiPageUsesTemplate ns9:cnote ;
dbpprop:cnoteProperty "a"@en ;
dbpprop:hasPhotoCollection .
dbpedia:Post_system dbpprop:redirect .
dbpedia:Turing-Post_Model dbpprop:redirect .
dbpedia:Formulation_1 dbpprop:redirect .
dbpedia:Post-Turing_Model dbpprop:redirect .
owl:sameAs .
dbpedia:Turing-Post_Machine dbpprop:redirect .
dbpedia:Turing-Post_program dbpprop:redirect .