10 computational complexity.pdf

10 computational complexity.pdf

ID:33929914

大小:1.54 MB

页数:57页

时间:2019-03-01

10 computational complexity.pdf_第1页
10 computational complexity.pdf_第2页
10 computational complexity.pdf_第3页
10 computational complexity.pdf_第4页
10 computational complexity.pdf_第5页
资源描述:

《10 computational complexity.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、10ComputationalComplexity10.1IntroductionNowyouknowthatcertainproblemscanbesolvedbyalgorithmsandcertainotherscannotbe.Indiscussingtheissueofalgorithmicsolvability,youhaveusedtheChurch–Turingthesis,whichasksyoutobelieveinthedictumthatalgorithmsarenothingbuttotalTuringmachines(TTM)thatusepotentia

2、llyinfinitetapes,anidealwhichwewillprobablynotbeabletorealize.Evenifwerealizethisideal,thereisapossibilitythataTMmaytakeanimpracticablylongtimeforgivingananswer.Thiscanhappenevenifthemachineoperatestoofast.Forexample,supposeyouwanttovisit50touristdestinationsspreadoutallovertheearth.Youknowtheco

3、stoftravelingfromeachdestinationtotheother.Dependinguponwhichplacetovisitfirst,andwhichonenext,youhavenow50!possibilitiesfromwhichyouwanttoselecttheonethatisthecheapest.Thenumberofpossibilitiestobeexploredistoolarge,50!>10025.Ifcomputingthecostforoneitineraryvisitingall50destinationstakesabillio

4、nthofasecond(toofastindeed),thenitwillrequirenolessthan1025humanlifetimestodeterminethecheapestitinerary.Thus,algorithmicsolvabilityalonedoesnotsuffice;weareinterestedinpracticalsolvability.Butwhatdoesitmeantosaythataproblemispracticallysolvable?Dowehavetorunanalgorithmforeachinstanceofasolvable

5、problemandthendetermineitspracticalsolvability?Thisisthemostuselessproposal,infact,animpossiblejob.Thesimplereasonisthatthereare,inallprobability,aninfinitenumberofinstancesofaproblem.Again,howdowemeasuretimeinthiscase?Measuringrealtimeisuseless.Astechnologyprogresses,computingtimeforthebasicope

6、rationsreduce,andhowdoweascertainthatourestimateisstillapplicable?Moreover,timeisnottheonlyfactorindiscussingefficiencyorpracticalityofalgorithms.Youmaybeinterestedintheworkingspaceanalgorithmmightdemandtosolveaproblem.Theissueofpracticalitymightalsodependontheparticularcomputationalmodelwechoos

7、e.WefixTuringmachinesasourcomputationalmodel.WewillmeasuretimeintermsofthenumberofstepsaTMtakesingettingasolution.Ofcourse,wemustA.Singh,ElementsofComputationTheory,TextsinComputerScience,327cSpringer-VerlagLondonLimited200932810C

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

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

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