2000 character limit reached
Computable real function F such that F is not polynomial time computable on [0,1]
Published 25 Apr 2014 in cs.CC | (1404.7053v1)
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))
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
