What motivated a leading complexity theorist to pivot toward algorithmic game theory and economic computation in the mid-1990s?
Answered at 4:00 in The 'Useless' Theory Behind Modern SNARKs (ft. Gödel Prize Winner Noam Nisan) · a16z crypto show
What motivated a leading complexity theorist to pivot toward algorithmic game theory and economic computation in the mid-1990s?
Noam Nisan was inspired by the emergence of the Internet around 1995, which he saw as a massive paradigm shift that academia was too slow to embrace. He made a conscious decision to shift from computational complexity theory toward understanding how to get different computers to cooperate over the Internet, even when they do not belong to the same company or have the same goal. He initially tried to build systems but discovered that the most fascinating aspect was the economic and coordination problems of distributed cooperation.
Full answer and detailsRead the whole answer, key facts and every other question from this episode
In short
Noam Nisan was inspired by the emergence of the Internet around 1995, which he saw as a massive paradigm shift that academia was too slow to embrace.
Noam Nisan · The 'Useless' Theory Behind Modern SNARKs (ft. Gödel Prize Winner Noam Nisan) · a16z crypto show · answer at 4:00
Key takeaways
- Noam Nisan was inspired by the emergence of the Internet around 1995, which he saw as a massive paradigm shift that academia was too slow to embrace.
The full answer · about 2 min
Noam Nisan was inspired by the emergence of the Internet around 1995, which he saw as a massive paradigm shift that academia was too slow to embrace. He made a conscious decision to shift from computational complexity theory toward understanding how to get different computers to cooperate over the Internet, even when they do not belong to the same company or have the same goal. He initially tried to build systems but discovered that the most fascinating aspect was the economic and coordination problems of distributed cooperation.
More answers from this episode
- 0:17What role did the LFKN paper play in establishing interactive proof systems for modern verification?
- 9:18How did the Popcorn project relate to ideas about verifying delegated computation?
- 16:16How does the SumCheck protocol enable verification of computation across massive datasets and cloud computing?
- 19:00How do modern SNARKs relate to interactive proofs and why is the SumCheck protocol central to current SNARK design?
- 20:00What is an interactive proof and why did it represent a fundamental extension of mathematical proof?
- 22:54What unexpected connection emerged between random self-reducibility and interactive proofs for hard computational problems?