. "\u5982\u679C\u4E0D\u52A0\u7279\u6B8A\u8BF4\u660E\uFF0C\u901A\u5E38\u6240\u8BF4\u7684\u56FE\u7075\u673A\u90FD\u662F\u786E\u5B9A\u578B\u56FE\u7075\u673A\u3002\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u548C\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u4E0D\u540C\u4E4B\u5904\u5728\u4E8E\uFF0C\u5728\u8BA1\u7B97\u7684\u6BCF\u4E00\u65F6\u523B\uFF0C\u6839\u636E\u5F53\u524D\u72B6\u6001\u548C\u8BFB\u5199\u5934\u6240\u8BFB\u7684\u7B26\u53F7\uFF0C\u673A\u5668\u5B58\u5728\u591A\u79CD\u72B6\u6001\u8F6C\u79FB\u65B9\u6848\uFF0C\u673A\u5668\u5C06\u4EFB\u610F\u5730\u9009\u62E9\u5176\u4E2D\u4E00\u79CD\u65B9\u6848\u7EE7\u7EED\u8FD0\u4F5C\uFF0C\u76F4\u5230\u6700\u540E\u505C\u673A\u4E3A\u6B62\u3002\u5177\u4F53\u800C\u8A00\uFF0C\u5176\u72B6\u6001\u8F6C\u79FB\u51FD\u6570\u4E3A \u5176\u4E2D\u662F\u72B6\u6001\u96C6\u5408\uFF0C\u662F\u5E26\u5B57\u6BCD\u8868\uFF0C\u5206\u522B\u8868\u793A\u8BFB\u5199\u5934\u5411\u5DE6\u548C\u5411\u53F3\u79FB\u52A8\uFF1B\u7B26\u53F7 \u8868\u793A\u96C6\u5408\u7684\u5E42\u96C6\uFF0C\u5373 \u4F8B\u5982\uFF0C\u8BBE\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u5F53\u524D\u72B6\u6001\u4E3A\uFF0C\u5F53\u524D\u8BFB\u5199\u5934\u6240\u8BFB\u7684\u7B26\u53F7\u4E3A\uFF0C\u82E5 \u5219\u5C06\u4EFB\u610F\u5730\u9009\u62E9\u4E00\u4E2A\uFF0C\u6309\u5176\u8FDB\u884C\u64CD\u4F5C\uFF0C\u7136\u540E\u8FDB\u5165\u4E0B\u4E00\u6B65\u8BA1\u7B97\u3002 \u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u5728\u8F93\u5165\u4E32\u4E0A\u7684\u8BA1\u7B97\u8FC7\u7A0B\u53EF\u4EE5\u8868\u793A\u4E3A\u4E00\u68F5\u6811\uFF0C\u4E0D\u540C\u7684\u5206\u652F\u5BF9\u5E94\u7740\u6BCF\u4E00\u6B65\u8BA1\u7B97\u7684\u4E0D\u540C\u7684\u53EF\u80FD\u6027\u3002\u53EA\u8981\u6709\u4EFB\u610F\u4E00\u4E2A\u5206\u652F\u8FDB\u5165\u63A5\u53D7\u72B6\u6001\uFF0C\u5219\u79F0\u63A5\u53D7\uFF1B\u53EA\u8981\u6709\u4EFB\u610F\u4E00\u4E2A\u5206\u652F\u8FDB\u5165\u62D2\u7EDD\u72B6\u6001\uFF0C\u5219\u79F0\u62D2\u7EDD\uFF1B\u67D0\u4E9B\u5206\u652F\u53EF\u80FD\u6C38\u8FDC\u65E0\u6CD5\u505C\u673A\uFF0C\u4F46\u53EA\u8981\u6709\u4E00\u4E2A\u5206\u652F\u53EF\u4EE5\u8FDB\u5165\u63A5\u53D7\u6216\u62D2\u7EDD\u72B6\u6001\uFF0C\u6211\u4EEC\u5C31\u8BF4\u5728\u8F93\u5165\u4E0A\u53EF\u505C\u673A\u3002\u6CE8\u610F\uFF0C\u6211\u4EEC\u89C4\u5B9A\u5FC5\u987B\u662F\u65E0\u77DB\u76FE\u7684\uFF0C\u5373\u5B83\u4E0D\u80FD\u6709\u67D0\u4E2A\u5206\u652F\u63A5\u53D7\u800C\u540C\u65F6\u53E6\u4E00\u4E2A\u5206\u652F\u62D2\u7EDD\uFF0C\u8FD9\u6837\u6709\u77DB\u76FE\u7684\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u662F\u4E0D\u5408\u6CD5\u7684\u3002 \u5B9A\u7406\uFF1A\u5BF9\u4E8E\u4EFB\u610F\u4E00\u4E2A\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF0C\u5B58\u5728\u4E00\u4E2A\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF0C\u4F7F\u5F97\u5B83\u4EEC\u7684\u8BED\u8A00\u76F8\u7B49\uFF0C\u5373\u3002 \u8BC1\u660E\uFF1A\u56E0\u4E3A\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u8BA1\u7B97\u8FC7\u7A0B\u5C31\u662F\u4E00\u68F5\u6811\uFF0C\u56E0\u6B64\u6211\u4EEC\u53EA\u9700\u904D\u5386\u8BE5\u6811\u5C31\u53EF\u4EE5\u6A21\u62DF\u5176\u8BA1\u7B97\u8FC7\u7A0B\u3002\u4E00\u4E2A\u7B80\u5355\u7684\u60F3\u6CD5\u662F\u5229\u7528\u6DF1\u5EA6\u4F18\u5148\u641C\u7D22\u6765\u904D\u5386\u7684\u8BA1\u7B97\u6811\uFF0C\u4F46\u8FD9\u6837\u884C\u4E0D\u901A\uFF0C\u56E0\u4E3A\u7684\u67D0\u4E9B\u8BA1\u7B97\u5206\u652F\u53EF\u80FD\u6C38\u8FDC\u4E0D\u505C\u673A\uFF01\u6240\u4EE5\u6211\u4EEC\u53EF\u4EE5\u91C7\u7528\u4E00\u79CD\u5728\u7B97\u6CD5\u8BBE\u8BA1\u4E2D\u79F0\u4E3A\u7684\u6280\u5DE7\u6765\u904D\u5386\u7684\u8BA1\u7B97\u6811\u3002\u5177\u4F53\u8BC1\u660E\u5982\u4E0B\uFF1A \u5BF9\u4E8E\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF0C\u6784\u9020\u4E00\u4E2A\u786E\u5B9A\u578B\u56FE\u7075\u673A\u5982\u4E0B\uFF1A 1. \n* \u4EE4\uFF1B 2. \n* \u6DF1\u5EA6\u4F18\u5148\u5730\u6A21\u62DF\u7684\u6BCF\u4E2A\u5206\u652F\u7684\u8BA1\u7B97\uFF0C\u4F46\u6BCF\u4E2A\u5206\u652F\u6700\u591A\u53EA\u8BA1\u7B97\u6B65\uFF0C\u5982\u679C\u67D0\u4E2A\u8BA1\u7B97\u5206\u652F\u5728\u6B65\u5185\u53EF\u4EE5\u505C\u673A\uFF0C\u5219\u4E5F\u505C\u673A\uFF0C\u5E76\u5C06\u8BE5\u8BA1\u7B97\u5206\u652F\u7684\u8BA1\u7B97\u7ED3\u679C\u8F93\u51FA\u3002 3. \n* \u4EE4\u589E\u52A0 1\uFF0C\u8DF3\u8F6C\u5230\u4E0A\u4E00\u6B65\u7EE7\u7EED\u6267\u884C\u3002 \u663E\u7136\uFF0C\u82E5\u6709\u67D0\u4E2A\u5206\u652F\u53EF\u4EE5\u505C\u673A\uFF0C\u5219\u6B64\u4E5F\u4E00\u5B9A\u4F1A\u627E\u5230\u8BE5\u5206\u652F\u5E76\u505C\u673A\u3002\u56E0\u6B64\u3002 \u5B9A\u74062\uFF1A\u5982\u679C\u8BED\u8A00L\u88AB\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u5728\u591A\u9879\u5F0F\u65F6\u95F4\u5185\u63A5\u53D7\uFF0C\u5219\u4E00\u5B9A\u5B58\u5728\u591A\u9879\u5F0FP\u4F7F\u5F97\u8BED\u8A00L\u88AB\u65F6\u95F4\u590D\u6742\u5EA6\u4E3A\u7684\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7A0B\u5E8F\u6240\u63A5\u53D7\u3002 \u5B9A\u74062\u8BF4\u660E\u4E86\u4E3A\u4EC0\u4E48\u5728\u8BC1\u660EP = NP\u4E4B\u524D\uFF0C\u6240\u6709\u7684NPC\u95EE\u9898\u90FD\u53EA\u6709\u6307\u6570\u65F6\u95F4\u590D\u6742\u5EA6\u7B97\u6CD5\u3002"@zh . . . . "Eine nichtdeterministische Turingmaschine (NTM, NDTM) in der theoretischen Informatik ist eine Turingmaschine, die anstatt einer \u00DCbergangsfunktion eine \u00DCbergangsrelation verwendet."@de . . . . "\u041D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0430 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0456\u043D\u0433\u0430"@uk . "M\u00E1quina de Turing n\u00E3o determin\u00EDstica"@pt . "In theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike a deterministic Turing machine."@en . . . . "Niedeterministyczna maszyna Turinga \u2013 teoretyczny model rozwa\u017Cany w teorii oblicze\u0144 w celu badania problem\u00F3w decyzyjnych. Niedeterministyczna maszyna Turinga jest zdefiniowana tak samo jak deterministyczna maszyna Turinga z jedyn\u0105 r\u00F3\u017Cnic\u0105 dotycz\u0105c\u0105 postaci funkcji przej\u015Bcia, kt\u00F3ra w przypadku maszyn niedeterministycznych zwraca zbi\u00F3r mo\u017Cliwych dzia\u0142a\u0144 maszyny."@pl . . . . . . "\u041D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0438\u043D\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u0430\u044F \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430"@ru . . "Machine de Turing non d\u00E9terministe"@fr . . . "\uBE44\uACB0\uC815\uB860\uC801 \uD29C\uB9C1 \uAE30\uACC4"@ko . . "1108542747"^^ . "Nichtdeterministische Turingmaschine"@de . "\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A"@zh . . "En teorio de komputado, nedeterminisma ma\u015Dino de Turing estas ma\u015Dino simila al ma\u015Dino de Turing, sed por kiu, en iuj okazoj, povas esti difinita pli ol unu varianto de la konduto. La elekto de konduto en \u0109i tia nedeterminisma okazo estas nomata kiel preno de konsilo de orakolo. Kiel nedeterminisma ma\u015Dino de Turing elektas kiu el la eblaj variantoj donas akcepton de la enigo: Nedeterminisma ma\u015Dino de Turing povas esti modelata per determinisma ma\u015Dino de Turing per kreo kaj la\u016Dvica prilaboro de kopioj de la modelata ma\u015Dino. \u0108i tiu modelado povas bezoni eksponente pli grandan rultempon."@eo . . . . . "\u041D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0438\u043D\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u0430\u044F \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430 (\u041D\u041C\u0422) \u2014 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430, \u0444\u0443\u043D\u043A\u0446\u0438\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0430 \u043A\u043E\u0442\u043E\u0440\u043E\u0439 \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u0435\u0442 \u0441\u043E\u0431\u043E\u0439 \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0438\u043D\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u043A\u043E\u043D\u0435\u0447\u043D\u044B\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442 (\u041D\u041A\u0410)."@ru . "21935"^^ . . "\u975E\u6C7A\u5B9A\u6027\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3"@ja . . "En teoria de la computaci\u00F3, una M\u00E0quina de Turing no determinista (MTN) \u00E9s una M\u00E0quina de Turing on el seu mecanisme de control treballa com un aut\u00F2mat finit no determinista."@ca . . . . . . "Nondeterministic Turing machine"@en . "Niedeterministyczna maszyna Turinga \u2013 teoretyczny model rozwa\u017Cany w teorii oblicze\u0144 w celu badania problem\u00F3w decyzyjnych. Niedeterministyczna maszyna Turinga jest zdefiniowana tak samo jak deterministyczna maszyna Turinga z jedyn\u0105 r\u00F3\u017Cnic\u0105 dotycz\u0105c\u0105 postaci funkcji przej\u015Bcia, kt\u00F3ra w przypadku maszyn niedeterministycznych zwraca zbi\u00F3r mo\u017Cliwych dzia\u0142a\u0144 maszyny. Ewolucje niedeterministycznej maszyny Turinga mo\u017Cna reprezentowa\u0107 w postaci drzewa w kt\u00F3rym ka\u017Cdy poziom odpowiada jednemu krokowi maszyny, natomiast rozga\u0142\u0119zienia wynikaj\u0105 z niedeterminizmu funkcji przej\u015Bcia. Taka maszyna ko\u0144czy prace w momencie, gdy dochodzi do poziomu ze stanem ko\u0144cowym w co najmniej jednym z w\u0119z\u0142\u00F3w. W tym modelu kolejny krok maszyny liczony jest jako przej\u015Bcie do nast\u0119pnego zbioru mo\u017Cliwych stan\u00F3w (poziomu drzewa). Dany problem mo\u017Ce zosta\u0107 rozwi\u0105zany w czasie wielomianowym na niedeterministycznej maszynie Turinga wtedy i tylko wtedy, gdy poprawno\u015B\u0107 rozwi\u0105zania tego problemu jest weryfikowalna w czasie wielomianowym na deterministycznej maszynie Turinga. Tego rodzaju problemy nale\u017C\u0105 do klasy NP (nondeterministic polynomial time)."@pl . . . "\u0412 \u0442\u0435\u043E\u0440\u0435\u0442\u0438\u0447\u043D\u0456\u0439 \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u0446\u0456 \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0430 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0456\u043D\u0433\u0430 \u2014 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0456\u043D\u0433\u0430, \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0443 \u044F\u043A\u043E\u0457 \u044F\u0432\u043B\u044F\u0454 \u0441\u043E\u0431\u043E\u044E \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442."@uk . . . . . . . "M\u00E1quina de Turing n\u00E3o-determin\u00EDstica em ci\u00EAncia da computa\u00E7\u00E3o \u00E9 uma m\u00E1quina de Turing cujo mecanismo de controle atua como um aut\u00F4mato finito n\u00E3o-determin\u00EDstico."@pt . "\uBE44\uACB0\uC815\uB860\uC801 \uD29C\uB9C1 \uAE30\uACC4(nondeterministic Turing machine, NTM)\uB294 \uD29C\uB9C1 \uAE30\uACC4\uC5D0\uC11C \uD2B9\uC815 \uC0C1\uD0DC\uC5D0\uC11C \uC6C0\uC9C1\uC77C \uC218 \uC788\uB294 \uC0C1\uD0DC\uC758 \uAC1C\uC218\uAC00 \uD558\uB098\uB85C \uC815\uD574\uC838 \uC788\uC9C0 \uC54A\uC740 \uACBD\uC6B0\uB97C \uB9D0\uD55C\uB2E4. \uC774\uAC83\uC740 \uC640 \uC720\uC0AC\uD55C \uAC1C\uB150\uC774\uB2E4. \uC774\uB3D9 \uAC00\uB2A5\uC131\uC774 \uD558\uB098\uB85C \uC815\uD574\uC838 \uC788\uB294 \uACB0\uC815\uB860\uC801 \uD29C\uB9C1 \uAE30\uACC4\uC640\uB294 \uBC18\uB300\uB85C, \uC774 \uAE30\uACC4\uC5D0\uC11C \uC774\uB3D9\uD560 \uC218 \uC788\uB294 \uC0C1\uD0DC\uC758 \uAC1C\uC218\uB294 \uC0C1\uD669\uC5D0 \uB530\uB77C \uB2E4\uB974\uBA70, \uC5EC\uB7EC \uAC1C\uAC00 \uB418\uAC70\uB098 \uC544\uC608 \uC5C6\uC744 \uC218\uB3C4 \uC788\uB2E4."@ko . . "In theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike a deterministic Turing machine. NTMs are sometimes used in thought experiments to examine the abilities and limits of computers. One of the most important open problems in theoretical computer science is the P versus NP problem, which (among other equivalent formulations) concerns the question of how difficult it is to simulate nondeterministic computation with a deterministic computer."@en . . "\u975E\u6C7A\u5B9A\u6027\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u6A5F\u68B0\uFF08\u3072\u3051\u3063\u3066\u3044\u305B\u3044\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u304D\u304B\u3044\u3001\u82F1: Non-deterministic Turing machine, NTM\uFF09\u306F\u3001\u7406\u8AD6\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3044\u3066\u3001\u975E\u6C7A\u5B9A\u6027\u6709\u9650\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306E\u3088\u3046\u306B\u50CD\u304F\u5236\u5FA1\u6A5F\u69CB\u3092\u6301\u3064\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u6A5F\u68B0\u3067\u3042\u308B\u3002"@ja . "Niedeterministyczna maszyna Turinga"@pl . . . . . . . "M\u00E1quina de Turing n\u00E3o-determin\u00EDstica em ci\u00EAncia da computa\u00E7\u00E3o \u00E9 uma m\u00E1quina de Turing cujo mecanismo de controle atua como um aut\u00F4mato finito n\u00E3o-determin\u00EDstico."@pt . "\u5982\u679C\u4E0D\u52A0\u7279\u6B8A\u8BF4\u660E\uFF0C\u901A\u5E38\u6240\u8BF4\u7684\u56FE\u7075\u673A\u90FD\u662F\u786E\u5B9A\u578B\u56FE\u7075\u673A\u3002\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u548C\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u4E0D\u540C\u4E4B\u5904\u5728\u4E8E\uFF0C\u5728\u8BA1\u7B97\u7684\u6BCF\u4E00\u65F6\u523B\uFF0C\u6839\u636E\u5F53\u524D\u72B6\u6001\u548C\u8BFB\u5199\u5934\u6240\u8BFB\u7684\u7B26\u53F7\uFF0C\u673A\u5668\u5B58\u5728\u591A\u79CD\u72B6\u6001\u8F6C\u79FB\u65B9\u6848\uFF0C\u673A\u5668\u5C06\u4EFB\u610F\u5730\u9009\u62E9\u5176\u4E2D\u4E00\u79CD\u65B9\u6848\u7EE7\u7EED\u8FD0\u4F5C\uFF0C\u76F4\u5230\u6700\u540E\u505C\u673A\u4E3A\u6B62\u3002\u5177\u4F53\u800C\u8A00\uFF0C\u5176\u72B6\u6001\u8F6C\u79FB\u51FD\u6570\u4E3A \u5176\u4E2D\u662F\u72B6\u6001\u96C6\u5408\uFF0C\u662F\u5E26\u5B57\u6BCD\u8868\uFF0C\u5206\u522B\u8868\u793A\u8BFB\u5199\u5934\u5411\u5DE6\u548C\u5411\u53F3\u79FB\u52A8\uFF1B\u7B26\u53F7 \u8868\u793A\u96C6\u5408\u7684\u5E42\u96C6\uFF0C\u5373 \u4F8B\u5982\uFF0C\u8BBE\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u5F53\u524D\u72B6\u6001\u4E3A\uFF0C\u5F53\u524D\u8BFB\u5199\u5934\u6240\u8BFB\u7684\u7B26\u53F7\u4E3A\uFF0C\u82E5 \u5219\u5C06\u4EFB\u610F\u5730\u9009\u62E9\u4E00\u4E2A\uFF0C\u6309\u5176\u8FDB\u884C\u64CD\u4F5C\uFF0C\u7136\u540E\u8FDB\u5165\u4E0B\u4E00\u6B65\u8BA1\u7B97\u3002 \u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u5728\u8F93\u5165\u4E32\u4E0A\u7684\u8BA1\u7B97\u8FC7\u7A0B\u53EF\u4EE5\u8868\u793A\u4E3A\u4E00\u68F5\u6811\uFF0C\u4E0D\u540C\u7684\u5206\u652F\u5BF9\u5E94\u7740\u6BCF\u4E00\u6B65\u8BA1\u7B97\u7684\u4E0D\u540C\u7684\u53EF\u80FD\u6027\u3002\u53EA\u8981\u6709\u4EFB\u610F\u4E00\u4E2A\u5206\u652F\u8FDB\u5165\u63A5\u53D7\u72B6\u6001\uFF0C\u5219\u79F0\u63A5\u53D7\uFF1B\u53EA\u8981\u6709\u4EFB\u610F\u4E00\u4E2A\u5206\u652F\u8FDB\u5165\u62D2\u7EDD\u72B6\u6001\uFF0C\u5219\u79F0\u62D2\u7EDD\uFF1B\u67D0\u4E9B\u5206\u652F\u53EF\u80FD\u6C38\u8FDC\u65E0\u6CD5\u505C\u673A\uFF0C\u4F46\u53EA\u8981\u6709\u4E00\u4E2A\u5206\u652F\u53EF\u4EE5\u8FDB\u5165\u63A5\u53D7\u6216\u62D2\u7EDD\u72B6\u6001\uFF0C\u6211\u4EEC\u5C31\u8BF4\u5728\u8F93\u5165\u4E0A\u53EF\u505C\u673A\u3002\u6CE8\u610F\uFF0C\u6211\u4EEC\u89C4\u5B9A\u5FC5\u987B\u662F\u65E0\u77DB\u76FE\u7684\uFF0C\u5373\u5B83\u4E0D\u80FD\u6709\u67D0\u4E2A\u5206\u652F\u63A5\u53D7\u800C\u540C\u65F6\u53E6\u4E00\u4E2A\u5206\u652F\u62D2\u7EDD\uFF0C\u8FD9\u6837\u6709\u77DB\u76FE\u7684\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u662F\u4E0D\u5408\u6CD5\u7684\u3002 \u5B9A\u7406\uFF1A\u5BF9\u4E8E\u4EFB\u610F\u4E00\u4E2A\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF0C\u5B58\u5728\u4E00\u4E2A\u786E\u5B9A\u578B\u56FE\u7075\u673A\uFF0C\u4F7F\u5F97\u5B83\u4EEC\u7684\u8BED\u8A00\u76F8\u7B49\uFF0C\u5373\u3002 \u8BC1\u660E\uFF1A\u56E0\u4E3A\u975E\u786E\u5B9A\u578B\u56FE\u7075\u673A\u7684\u8BA1\u7B97\u8FC7\u7A0B\u5C31\u662F\u4E00\u68F5\u6811\uFF0C\u56E0\u6B64\u6211\u4EEC\u53EA\u9700\u904D\u5386\u8BE5\u6811\u5C31\u53EF\u4EE5\u6A21\u62DF\u5176\u8BA1\u7B97\u8FC7\u7A0B\u3002\u4E00\u4E2A\u7B80\u5355\u7684\u60F3\u6CD5\u662F\u5229\u7528\u6DF1\u5EA6\u4F18\u5148\u641C\u7D22\u6765\u904D\u5386\u7684\u8BA1\u7B97\u6811\uFF0C\u4F46\u8FD9\u6837\u884C\u4E0D\u901A\uFF0C\u56E0\u4E3A\u7684\u67D0\u4E9B\u8BA1\u7B97\u5206\u652F\u53EF\u80FD\u6C38\u8FDC\u4E0D\u505C\u673A\uFF01\u6240\u4EE5\u6211\u4EEC\u53EF\u4EE5\u91C7\u7528\u4E00\u79CD\u5728\u7B97\u6CD5\u8BBE\u8BA1\u4E2D\u79F0\u4E3A\u7684\u6280\u5DE7\u6765\u904D\u5386\u7684\u8BA1\u7B97\u6811\u3002\u5177\u4F53\u8BC1\u660E\u5982\u4E0B\uFF1A"@zh . "\u0412 \u0442\u0435\u043E\u0440\u0435\u0442\u0438\u0447\u043D\u0456\u0439 \u0456\u043D\u0444\u043E\u0440\u043C\u0430\u0442\u0438\u0446\u0456 \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0430 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0456\u043D\u0433\u0430 \u2014 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044E\u0440\u0456\u043D\u0433\u0430, \u0444\u0443\u043D\u043A\u0446\u0456\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0443 \u044F\u043A\u043E\u0457 \u044F\u0432\u043B\u044F\u0454 \u0441\u043E\u0431\u043E\u044E \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0456\u043D\u043E\u0432\u0430\u043D\u0438\u0439 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442."@uk . "Une machine de Turing non d\u00E9terministe est similaire \u00E0 une machine de Turing habituelle, qui, elle, est d\u00E9terministe, mais s'en diff\u00E9rencie dans le fait qu'\u00E9tant non d\u00E9terministe elle peut avoir plusieurs transitions activables, pour un \u00E9tat donn\u00E9."@fr . "Une machine de Turing non d\u00E9terministe est similaire \u00E0 une machine de Turing habituelle, qui, elle, est d\u00E9terministe, mais s'en diff\u00E9rencie dans le fait qu'\u00E9tant non d\u00E9terministe elle peut avoir plusieurs transitions activables, pour un \u00E9tat donn\u00E9."@fr . "Eine nichtdeterministische Turingmaschine (NTM, NDTM) in der theoretischen Informatik ist eine Turingmaschine, die anstatt einer \u00DCbergangsfunktion eine \u00DCbergangsrelation verwendet."@de . . . . . . "\u975E\u6C7A\u5B9A\u6027\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u6A5F\u68B0\uFF08\u3072\u3051\u3063\u3066\u3044\u305B\u3044\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u304D\u304B\u3044\u3001\u82F1: Non-deterministic Turing machine, NTM\uFF09\u306F\u3001\u7406\u8AD6\u8A08\u7B97\u6A5F\u79D1\u5B66\u306B\u304A\u3044\u3066\u3001\u975E\u6C7A\u5B9A\u6027\u6709\u9650\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306E\u3088\u3046\u306B\u50CD\u304F\u5236\u5FA1\u6A5F\u69CB\u3092\u6301\u3064\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u6A5F\u68B0\u3067\u3042\u308B\u3002"@ja . "En teorio de komputado, nedeterminisma ma\u015Dino de Turing estas ma\u015Dino simila al ma\u015Dino de Turing, sed por kiu, en iuj okazoj, povas esti difinita pli ol unu varianto de la konduto. La elekto de konduto en \u0109i tia nedeterminisma okazo estas nomata kiel preno de konsilo de orakolo. Malsimile al determinisma ma\u015Dino de Turing kiu havas nur unu vojon de kalkulado, nedeterminisma ma\u015Dino de Turing havas arbon de la vojoj. Nedeterminisma ma\u015Dino de Turing akceptas la enigon se iu el bran\u0109oj de la arbo halti\u011Das je la akcepta stato a\u016D alivorte redonas jesan respondon. Tiel, la nea kaj jesa respondo ne estas simetriaj por \u0109i tia ma\u015Dino. Eblas diri, ke \u011Dia respondo estas logika a\u016Do de respondoj de \u0109iuj bran\u0109oj, kaj e\u0109 unu \"jes\" sufi\u0109as por ke estu entuta \"jes\". Kiel nedeterminisma ma\u015Dino de Turing elektas kiu el la eblaj variantoj donas akcepton de la enigo: \n* Eblas konsideri, ke \u011Di estas \u0109iam bon\u015Danca, do \u011Di \u0109iam elektas tiun varianton kiu rezulti\u011Das je akcepto de la enigo, se \u0109i tia varianto ekzistas (konsilas kun bona orakolo). \n* Eblas konsideri, ke en \u0109iu okazo kiam estas pli ol unu varianto \u011Di faras kopiojn de si, kaj la malsamaj kopioj laboras plu la\u016D \u0109iu el la eblaj variantoj. Poste \u0109iu el la kopioj denove povas disdividi\u011Di, kaj la kvanto de funkciantaj kopioj povas kreski eksponente kun tempo. Nedeterminisma ma\u015Dino de Turing povas esti modelata per determinisma ma\u015Dino de Turing per kreo kaj la\u016Dvica prilaboro de kopioj de la modelata ma\u015Dino. \u0108i tiu modelado povas bezoni eksponente pli grandan rultempon."@eo . "\u041D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0438\u043D\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u0430\u044F \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430 (\u041D\u041C\u0422) \u2014 \u043C\u0430\u0448\u0438\u043D\u0430 \u0422\u044C\u044E\u0440\u0438\u043D\u0433\u0430, \u0444\u0443\u043D\u043A\u0446\u0438\u044F \u043F\u0435\u0440\u0435\u0445\u043E\u0434\u0430 \u043A\u043E\u0442\u043E\u0440\u043E\u0439 \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u0435\u0442 \u0441\u043E\u0431\u043E\u0439 \u043D\u0435\u0434\u0435\u0442\u0435\u0440\u043C\u0438\u043D\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u044B\u0439 \u043A\u043E\u043D\u0435\u0447\u043D\u044B\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442 (\u041D\u041A\u0410)."@ru . . . . "M\u00E0quina de Turing no determinista"@ca . . "En teoria de la computaci\u00F3, una M\u00E0quina de Turing no determinista (MTN) \u00E9s una M\u00E0quina de Turing on el seu mecanisme de control treballa com un aut\u00F2mat finit no determinista."@ca . "\uBE44\uACB0\uC815\uB860\uC801 \uD29C\uB9C1 \uAE30\uACC4(nondeterministic Turing machine, NTM)\uB294 \uD29C\uB9C1 \uAE30\uACC4\uC5D0\uC11C \uD2B9\uC815 \uC0C1\uD0DC\uC5D0\uC11C \uC6C0\uC9C1\uC77C \uC218 \uC788\uB294 \uC0C1\uD0DC\uC758 \uAC1C\uC218\uAC00 \uD558\uB098\uB85C \uC815\uD574\uC838 \uC788\uC9C0 \uC54A\uC740 \uACBD\uC6B0\uB97C \uB9D0\uD55C\uB2E4. \uC774\uAC83\uC740 \uC640 \uC720\uC0AC\uD55C \uAC1C\uB150\uC774\uB2E4. \uC774\uB3D9 \uAC00\uB2A5\uC131\uC774 \uD558\uB098\uB85C \uC815\uD574\uC838 \uC788\uB294 \uACB0\uC815\uB860\uC801 \uD29C\uB9C1 \uAE30\uACC4\uC640\uB294 \uBC18\uB300\uB85C, \uC774 \uAE30\uACC4\uC5D0\uC11C \uC774\uB3D9\uD560 \uC218 \uC788\uB294 \uC0C1\uD0DC\uC758 \uAC1C\uC218\uB294 \uC0C1\uD669\uC5D0 \uB530\uB77C \uB2E4\uB974\uBA70, \uC5EC\uB7EC \uAC1C\uAC00 \uB418\uAC70\uB098 \uC544\uC608 \uC5C6\uC744 \uC218\uB3C4 \uC788\uB2E4."@ko . "12289"^^ . "Nedeterminisma ma\u015Dino de Turing"@eo . .