Computable real function F such that F is not polynomial time computable on [0,1]
Computational Complexity
2014-04-29 v1
Abstract
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))
Cite
@article{arxiv.1404.7053,
title = {Computable real function F such that F is not polynomial time computable on [0,1]},
author = {Sergey V. Yakhontov},
journal= {arXiv preprint arXiv:1404.7053},
year = {2014}
}
Comments
5 pages