8 A noncomputably enumerably language.pdf

8 A noncomputably enumerably language.pdf

ID:34853239

大小:1.17 MB

页数:36页

时间:2019-03-12

8 A noncomputably enumerably language.pdf_第1页
8 A noncomputably enumerably language.pdf_第2页
8 A noncomputably enumerably language.pdf_第3页
8 A noncomputably enumerably language.pdf_第4页
8 A noncomputably enumerably language.pdf_第5页
资源描述:

《8 A noncomputably enumerably language.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、8ANoncomputablyEnumerableLanguage8.1IntroductionInSect.7.7,Igaveapassingcommentthatthesetofcompositenumbersiscom-putablyenumerable.Thereisaminorhuddleinusingtheterminologytoarbitrarysets,forexample,asetofnumbers,ratherthantolanguages.Thatisnotabighud-dle,forwejustrepresen

2、tacountablesetbyalanguageandtrytosolvetheproblemaboutthelanguage.Agreedthatwecanusetheadjective“computablyenumerable”forsets,howdoweproceedtoshowthatthesetofcompositenumbersiscomputablyenumerable?Itssolution,assuggestedthere,requiresaTuringmachinecapableofmultiplyingtwonu

3、mberspandq.Nowthisissomethingunnaturaltothewaywewereusingallourautomata.Why?Wehaveusedallvarietiesofautomataaslanguageacceptors,which,givenastring,wouldsignaltouswhetheritacceptsthestringornot.Here,whenwesaythatwewantmultiplicationofpandq,ourrequirementisabitmoredemanding

4、.WewantaTuringmachinenotonlytooperateandhaltonaninput,butalsoitshouldgiveusanoutputuponhalting.Toaddtotheproblem,whenamachinehaltsaftergivinganoutput,anothermachinemayalsoworkonthesametape,takingthecontentofthetapeasitsin-puttape.Thatis,thefirstmachinemustleavethetapeinsuc

5、hawaythatitcanbeusedasaninitialtapeforanothermachine.Asourinputsarewrittenasbu,wheretheread/writeheadisplacedinitiallyonthebprecedingtheinput,wemaylikeouroutputtobeinthesameform.Thismeansthatthefirstmachinemustscanthesymbolbprecedingtheoutputwhilehaltingsothatthesecondm

6、achinewillstartworking.Thisrequirementamountstoimaginingthemachineasthecontrolunitonly,whereasthetapeandtheread/writeheadcanbedetachedfromitandattachedtoanothermachinethatmightworkafterthefirsthadcompleteditsjob.Itgoesalongwellwithourmachinecombinationsalso.Wewillputitasac

7、onventionwhilecom-putinganyfunction.A.Singh,ElementsofComputationTheory,TextsinComputerScience,245cSpringer-VerlagLondonLimited20092468ANoncomputablyEnumerableLanguage8.2TuringMachinesasComputersComputingafunctionf(·)meansthatgivenaninputxtothemachine,itmustoutputthevalu

8、ef(x)uponhalting.Aswehaveadoptedourdatastructureasstrings,wewillusethemforcomputingfunctionsmapp

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。