Publisher
Springer Science and Business Media LLC
Subject
Physics and Astronomy (miscellaneous),General Mathematics
Reference36 articles.
1. Adamyan, V. A., Calude, C. S., and Pavlov, B. S. (2004). Transcending the limits of Turing computability. T. Hida, K. Saito, S. Si, (ed), Quantum Information Complexity. Proceedings of Meijo Winter School 2003, World Scientific, Singapore,pp. 119–137. %!http://arXiv.org/quant-ph/ 0304128!
2. Atallah, M. J. (ed.) (1999). Algorithms and Theory of Computation Handbook, CRC Press, Boca Raton, Florida.
3. Berlekamp, E. R., Conway, J. H., and Guy, R. K. (2004). Winning Ways for Your Mathematical Plays, vol. 4, 2nd Edn., Academic Press, New York.
4. Beggs, E. J. and Tucker, J. V. (2004). Computations via Experiments with Kinematic Systems, Technical Report 5–2004, Department of Computer Science, University of Wales Swansea.
5. Benioff, P. (1980). The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing Machines. Journal of Statistical Physics 22, 563– 591.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献