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, Un

Source URL: www-compsci.swan.ac.uk

• Computability 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