Publisher
Springer International Publishing
Reference24 articles.
1. Apelian, C., Surace, S.: Real and Complex Analysis. CRC Press, Boca Raton (2009)
2. Baumeler, Ä., Wolf, S.: Computational tameness of classical non-causal models. Proc. R. Soc. A 474(2209) (2018). https://doi.org/10.1098/rspa.2017.0698
3. Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Graph. Darst, vol. 53. Cambridge University Press, Cambridge (2002)
4. 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. Am. Math. Soc. 21, 1–46 (1989). https://doi.org/10.1090/S0273-0979-1989-15750-9
5. Lecture Notes in Computer Science;O Bournez,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Atemporal Model of Physical Complexity;Electronic Proceedings in Theoretical Computer Science;2018-07-02