1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2014★ 1 cited
Notes on space complexity of integration of computable real functions in Ko-Friedman model
Sergey V. Yakhontov
In the present paper it is shown that real function is a linear-space computable real function on interval if is a linear-space computable $C^…
cs.CC2014
FP//LINSPACE computability of Riemann zeta function in Ko-Friedman model
Sergey V. Yakhontov
In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function for all real , , in polynomial time and linear space on Turing machi…
cs.CC2014
Computable real function F such that F is not polynomial time computable on [0,1]
Sergey V. Yakhontov
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 do…