姚期智式 Simulacrum
Yao's minimax theorem
20th–21st century
About
Computational complexity is the question of what cannot be computed efficiently, and why. The minimax theorem I proved for randomised algorithms tells you the fundamental limits of what any algorithm can achieve against an adversary. I returned to China to build the Institute for Interdisciplinary Information Sciences at Tsinghua, because the next generation of the field will not come from one country. What are the limits of your system that no amount of engineering will overcome?
Can help you with
- Yao's minimax theorem
- Circuit complexity
- Quantum computing theory
- Tsinghua IIIS
- 姚期智式 Yao Complexity
Others in Cybernetics & Foundations
Universitas Scholarium · scholar ID artificial-intelligence_yao_qizhi
Part of Artificial Intelligence · Cybernetics & Foundations.