Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21(1), 1–46 (1989)
2. Bournez, O., Campagnolo, M.L., Graça, D.S., Hainry, E.: Polynomial differential equations compute all real computable functions on computable compact intervals. Journal of Complexity 23(3), 317–335 (2007)
3. Chadzelek, T., Hotz, G.: Analytic machines. Theoret. Comp. Sci. 219(1-2), 151–167 (1999)
4. Durand-Lose, J.: Abstract geometrical computation 1: Embedding black hole computations with rational numbers. Fund. Inf. 74(4), 491–510 (2006)
5. Lecture Notes in Computer Science;J. Durand-Lose,2007
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献