Yuav kom qhia tau tias ib hom lus tuaj yeem txiav txim siab, peb xav tau los tsim lub tshuab Turing uas yuav nres ntawm txhua txoj hlua nkag los ntawm cov lus cov tsiaj ntawv. Txij li thaum M yog dfa, peb twb muaj lub tshuab Turing thiab tsuas yog xav tau qhia tias dfa nres ntawm txhua qhov kev tawm tswv yim.
Koj suav qhov Kev Txiav Txim Li Cas?
Ib hom lus yog txiav txim tau yog tias thiab tsuas yog nws thiab nws cov lus qhia tau lees paub. Pov thawj. Yog hais tias ib hom lus yog txiav txim tau, ces nws complement yog decidable (los ntawm kaw nyob rau hauv complementation).
Koj ua pov thawj Turing Decidability li cas?
Ua pov thawj tias cov lus nws paub yog sib npaug rau cov lus muab thiab tias cov algorithm nres ntawm txhua qhov kev nkag. Txhawm rau ua pov thawj tias ib hom lus yog Turing-paub tau: Tsim cov txheej txheem uas lees txais cov hlua uas yog hom lus Nws yuav tsum tsis kam lees lossis voj ntawm ib txoj hlua tsis yog hom lus.
Yuav ua li cas koj thiaj paub yog hom lus paub?
Ib hom lus L yog paub tau yog tias thiab tsuas yog muaj ib tus neeg kuaj xyuas rau L, qhov chaw kuaj xyuas yog lub tshuab Turing uas nres ntawm txhua qhov kev nkag thiab rau txhua qhov w∈Σ∗, w∈L↔∃c∈∗. V lees txais ⟨w, c⟩.
Koj qhia li cas qhov teeb meem tsis tuaj yeem txiav txim siab?
Qhov Teeb Meem Tag Nrho yog Tsis Txaus Siab
Lub h alting teeb meem tuaj yeem siv los qhia tias lwm yam teeb meem tsis tuaj yeem txiav txim siab. Tag Nrho Cov Teeb Meem: Ib qho kev ua haujlwm (lossis qhov program) F tau hais tias tag nrho yog F(x) tau txhais rau txhua x (lossis zoo ib yam, yog F(x) nres rau tag nrho x). Kev txiav txim siab seb puas lossis tsis ua haujlwm F yog tag nrho tsis tuaj yeem txiav txim siab.
