Multi-conditional Descriptions and Codes in Kolmogorov Complexity

Jan 27, 2000 - x and y) as length of the shortest program that outputs x given the input y.i. We suppose that programs are written in some optimal programming ...
145KB taille 3 téléchargements 301 vues
Electronic Colloquium on Computational Complexity, Report No. 15 (2000)



    !"#%$& '( )* +, -  /.$& 0+132  4 57698:cjxi‰ ‘0bd³"i^”lcopqjxuo’y±fcv `v`obduvy bziˆ‘&f{|cŠc pqei jqt f ‹ € `on i fb¿‹§jxfuoKy&bdco`vŽˆfuoi j|‡‰]fpC‰ jC‹’bdgdbdp`a‹Gtˆ€ bzi cv‡`ouv`vbzbz‰ˆjxi€ `obd•@j|iŠc¤pCjC`v}|bdfcauT‹§K`vbdn i bd{c9co`oŽ]n pCf‡f|‡‚Dj|iˆ½kt nˆbdbz`oc3bdj|t i bdco`o¥ouv¸Xbd¨‰ € ¥¶cv`on bdjxjCi’ekn iZfgz‰]ŽŠf€ gdjCc9eŸŽˆ¨ŠuojC‹§}|jxfu f‰ }|bdi^fuopC uv cv`oV–uobdi ^˜{x—±ckjCgdj|‹D.{ gzf^vi ‚{|¥¶`v²›n fŠš ekS bdgzD En^œŽpX}x¶fgdjx‹G.{ € uo^QC`vn ‚DfÅ Hu n  S!Q¥ TaÌžK¨k¥§ÊDt Í fÉ|i ¨‚j|¨P`vf¦m`vfn >` f™ Ž uvf‰]‘^f'7`ojCnˆŸ‹ f'•coQ¥ fT`ažKjq¨‹ jC‹9gdfi {x`onnš‚° jxi cobdt fuk`vn f‡jxi t bd`obdjxi©   ‰¡ ™ Í {Í g•"È ¢£%¤¤R¥ D©DÍ ’ alCekn fuof’Í ’ ŒÍoÒ ¦&Í ’¼Í xÈ ‚ ‘^¬ŸKjCfe t `o Dn lIf''fpq}xi fiKt `   žNe f"€7n^’ pX }|f  ¥Q=ž”¨V€ n^pqcŽˆuoj|‰]pC‰ bdgdbd`a#gdfcvc`on]pCik^ ¨  ‚'ƒKj7‹§jxu ­Du ÄÍ