Alan Turing, every mention
4 scenes · ← back to Alan Turing
tap a year for its mentions
every year anyone Scott Aaronson 1Dr. Fei-Fei Li 1Bob McGrew 1Ankit Gupta 1
Verbatim, from the transcripts: the passages where Alan Turing comes up
Recursion Is The Next Scaling Law In AI · Y Combinator
- ▶ 6:20 Ankit Gupta Yeah, so this is just like a, this is like going back to like Alan, Alan Turing now, and like a Turing machine, right?
Fei-Fei Li: Spatial Intelligence is the Next Frontier in AI · Y Combinator
- ▶ 35:33 Dr. Fei-Fei Li The founding fathers of AI who came together in 1956 in Dartmouth, you know, the John McCarthy and Marvin Minsky of them, they wanted to solve the problem of machines that can think, and that's a problem that Turing, Alan Turing, also put…
Bob McGrew: AI Agents And The Path To AGI · Y Combinator
- ▶ 0:05 Bob McGrew It passes the Turing test.
Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
- ▶ 55:28 Scott Aaronson And so then the nth Busy Beaver number is defined as the largest number of steps that can be, uh, taken by any Turing machine with n states, you know, uh, as defined by Alan Turing in 1936 before, uh, it, it halts.