Date: 2012-04-11 07:58:28Computability theory Complexity classes Models of computation Alan Turing Oracle machine Turing reduction John V. Tucker Probabilistic Turing machine Reduction Theoretical computer science Applied mathematics Computational complexity theory | | Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, UnAdd to Reading ListSource URL: www-compsci.swan.ac.ukDownload Document from Source Website File Size: 378,76 KBShare Document on Facebook
|