arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.2364cs.CC
收藏

关于Ko-Friedman模型中可计算实函数积分的空间复杂度的注记

Notes on space complexity of integration of computable real functions in Ko-Friedman model

Sergey V. Yakhontov

摘要:

本文证明了实函数$g(x)=\int_{0}^{x}f(t)dt$是区间$[0,1]$上的线性空间可计算实函数,如果$f$是区间$[0,1]$上的线性空间可计算$C^2[0,1]$实函数,并且这个结果不依赖于计算复杂性理论中的任何公开问题.在基于柯西函数可由图灵机计算的概念的Ko-Friedman模型下,研究了可计算实函数和可计算实函数积分的时间复杂度.另外,给出了一个实可计算函数$f$,使得$\int_{0}^{1}f\in FDSPACE(n^2)_{C[a,b]}$但$\int_{0}^{1}f\notin FP_{C[a,b]}$若$FP\ne#P$ .

英文摘要:

In the present paper it is shown that real function $g(x)=\int_{0}^{x}f(t)dt$ is a linear-space computable real function on interval $[0,1]$ if $f$ is a linear-space computable $C^2[0,1]$ real function on interval $[0,1]$, and this result does not depend on any open question in the computational complexity theory. The time complexity of computable real functions and integration of computable real functions is considered in the context of Ko-Friedman model which is based on the notion of Cauchy functions computable by Turing machines. In addition, a real computable function $f$ is given such that $\int_{0}^{1}f\in FDSPACE(n^2)_{C[a,b]}$ but $\int_{0}^{1}f\notin FP_{C[a,b]}$ if $FP\ne#P$.

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

↑