Conditional computability of real functions with respect to a class of operators
From MaRDI portal
Publication:1944333
DOI10.1016/j.apal.2012.11.004zbMath1297.03026arXiv1210.6298MaRDI QIDQ1944333
Dimiter Skordev, Ivan Georgiev
Publication date: 5 April 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6298
computable real-valued function; TTE; conditional computability; elementary functions of calculus; subrecursive; uniform computability
03D15: Complexity of computation (including implicit computational complexity)
03D20: Recursive functions and relations, subrecursive hierarchies
03D78: Computation over the reals, computable analysis
Related Items