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

可计算实函数F使得F在[0,1]上不是多项式时间可计算的

Computable real function F such that F is not polynomial time computable on [0,1]

Sergey V. Yakhontov

摘要:

本文构造了[0,1]上的可计算实函数F,使得在图灵机上对[0,1]上的函数求值存在指数时间算法,但在图灵机上对[0,1]上的函数求值不存在任何多项式时间算法(而且对(0,1)上的任意有理点都成立)

英文摘要:

A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the evaluation of the function on [0,1] on Turing machine (moreover, it holds for any rational point on (0,1))

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

↑