arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.1547cs.CCcs.DS
收藏

短时间内短节目短名单

Short lists with short programs in short time

Bruno Bauwens, Anton Makhlin, Nikolay Vereshchagin, Marius Zimand

摘要:

给定一台机器$U$,$x$的$c$ -短程序是一个字符串$p$,使得$U(p)=x$和$p$的长度由$c$ +($x$的最短程序的长度)限制。我们表明,对于任何标准的图灵机,它是可能的计算在多项式时间的输入$x$一个列表的多项式大小保证包含一个O $(\log |x|)$ -短程序$x$。我们还表明,存在一个可计算的功能,映射到一个列表的大小$|x|^2$包含一个O $(1)$ -短程序的$x$的每个$x$。这基本上是最优的,因为我们证明,对于每个这样的功能有一个$c$和无限多的$x$列表的大小至少为$c|x|^2$。最后,我们表明,对于一些标准的机器,可计算函数生成列表与$0$ -短程序,必须有无限经常列表大小成正比的$2^{|x|}$。

英文摘要:

Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any standard Turing machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a O$(\log |x|)$-short program for $x$. We also show that there exists a computable function that maps every $x$ to a list of size $|x|^2$ containing a O$(1)$-short program for $x$. This is essentially optimal because we prove that for each such function there is a $c$ and infinitely many $x$ for which the list has size at least $c|x|^2$. Finally we show that for some standard machines, computable functions generating lists with $0$-short programs, must have infinitely often list sizes proportional to $2^{|x|}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑