Author:
Copeland B. Jack,Shagrir Oron
Publisher
Springer International Publishing
Reference63 articles.
1. Aaronson, S. (2005). Guest column: NP-complete problems and physical reality. ACM SIGACT News, 36(1), 30–52.
2. Andréka, H., Németi, I., & Németi, P. (2009). General relativistic hypercomputing and foundation of mathematics. Natural Computing, 8, 499–516.
3. Barrett, J. A., & Aitken, W. (2010). A note on the physical possibility of ordinal computation. The British Journal for the Philosophy of Science, 61, 867–874.
4. Button, T. (2009). SAD computers and two versions of the Church-Turing thesis. The British Journal for the Philosophy of Science, 60, 765–792.
5. Calude, C. S., Dinneen, M. J., Dumitrescu, M., & Svozil, K. (2010). Experimental evidence of quantum randomness incomputability. Physical Review A, 82: 022102–1-022102–8.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献