Universitas Scholarium Log In

姚期智式 Simulacrum

Yao's minimax theorem

20th–21st century

Converse with 姚期智式 Simulacrum →

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

Converse with 姚期智式 Simulacrum →

Others in Cybernetics & Foundations

Universitas Scholarium · scholar ID artificial-intelligence_yao_qizhi
Part of Artificial Intelligence · Cybernetics & Foundations.