Kolmogorov Complexity

Kolmogorov Complexity

ID:40390092

大小:215.51 KB

页数:14页

时间:2019-08-01

Kolmogorov Complexity_第1页
Kolmogorov Complexity_第2页
Kolmogorov Complexity_第3页
Kolmogorov Complexity_第4页
Kolmogorov Complexity_第5页
资源描述:

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

1、KolmogorovComplexityLanceFortnow1.Introduction010101010101010101010101100111011101011100100110110100110010110100101100Considerthethreestringsshownabove.Althoughallare24-bitbinarystringsandthereforeequallylikelytorepresenttheresultof24 ipsofafaircoin,thereisamarkeddi erenc

2、einthecomplexityofdescribingeachofthethree.The rststringcanbefullydescribedbystatingthatitisa24-bitstringwitha1inpositionniffnisodd,thethirdhasthepropertythatpositioniisa1iffthereareanoddnumberof1'sinthebinaryexpansionofpositioni,butthesecondstringappearsnottohaveasimilarl

3、ysimpledescription,andthusinordertodescribethestringwearerequiredtoreciteitscontentsverbatim.Whatisadescription?Fix=f0;1g.Letf:7!.Then(relativetof),adescriptionofastringissimplysomewithf()=:Careisneededinusingthisde nition.Withoutfurtherrestrictions,paradoxesarepo

4、ssible(considerthedescriptionthesmallestpositiveintegernotdescribableinfewerthan ftywords").Werestrictfbyrequiringthatitbecomputable,althoughnotnecessarilytotal,butdonotinitiallyconcernourselveswiththetime-complexityoff.Wearenowabletode neKolmogorovComplexityCf:(minfjpj:f

5、(p)=xgifx2ranfDe nition1.1.Cf(x)=1otherwiseItwouldbebettertohavea xednotionofdescriptionratherthanhavingtode nefeachtime.Or,indeed,tohaveanotionofcomplexitythatdoesnotvaryaccordingtowhichfwechoose.Tosomeextentthisproblemisunavoidable,butwecanachieveasortofindependenceifweu

6、seaUniversalTuringMachineThisarticlewaspreparedfromnotesoftheauthortakenbyAmyGaleinKaikoura,January2000.2(UTM).Asiswellknown,thereexistsaTuringMachineUsuchthatforallpartialcomputablef,thereexistsaprogrampsuchthatforally,U(p;y)=f(y).Wede neapartialcomputablefunctiongbylett

7、ingg(0jpj1py)=U(p;y).Thefollowingbasicfactisnotdiculttosee,andremovesthedependenceonf.ThusitallowsustotalkabouttheKolmogorovcomplexity.Claim1.1.Forallpartialcomputablefthereexistsaconstantcsuchthatforallx,Cg(x)Cf(x)+c.(Infact,c=2jpj+1,wherepisaprogramforf.)Nowde neC(x)=C

8、g(x).Aswehaveseen,thisiswithinaconstantofothercomplexities.WecanalsoextendClaim1.1tobinar

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

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

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