NVIDIA's Jim Fan: Physical Turing Test May Be Harder Than the Riemann Hypothesis
DrJimFan · x · 2026-10-07
NVIDIA senior research scientist Jim Fan argued in a widely-discussed tweet that humanity will likely solve the Riemann hypothesis before passing the Physical Turing Test — coming home after a wild Sunday party and being unable to tell whether a human or a robot cleaned up.
He suggests we are still not taking Moravec's paradox seriously enough — the counterintuitive finding that perceptual and motor tasks humans find trivial are the hardest for AI. The post echoes a core tension in embodied AI: high-level reasoning is advancing fast, while dexterous physical manipulation and generalization remain unsolved.
More from AGI Musings
- A debate on whether AI abundance is distributed equally to everyone — LeviTurk · 2026-10-07
- AI Ads for AI Apps for an Audience Being Replaced by AI: 'The Circularity Is Here' — sull · 2026-10-07
- Ex-Google's Lucas Beyer: Prof's 'Fudge Factor' Admission Was an Eye-Opener and Life Saver — giffmana · 2026-10-07
- $50 and GPT-4.1 made 50,000 fake stats — ChatGPT cited them 72,000 times a month — metehan777 · 2026-10-07
- Professor argues SWE lacks math-style open problems—yet AI models still crush 'solved' tasks — DimitrisPapail · 2026-10-07
- While others prophesy math's death, a professor considers hiring a math PhD for the first time — dyamins · 2026-10-07