Chr Szegedy Debunks Myth: Finding Counterexamples Isn't Always Easier for AI
ChrSzegedy · x · 2026-08-02
Chr Szegedy challenges the assumption that finding counterexamples is inherently simpler for AI than proving general statements.
He argues that the complexity of both tasks likely spans a wide spectrum rather than one being strictly easier. However, he agrees with the notion that if a mathematical conjecture survives sustained attacks from AI, it is highly probable to be true.
Related event: AI Math Test: Good at Finding Counterexamples, Struggles with Proofs(5 posts)→
More from AGI Musings
- Is superintelligence a bigger crypto threat than quantum? Experts split — examachine · 2026-10-16
- 'AI fakes intelligence the way a crane fakes strength' — pushback on the 'AI is a scam' take — LucaAmb · 2026-10-16
- MIT's Buehler: AI as 'a new language of science,' three years on — ProfBuehlerMIT · 2026-10-16
- Mere availability of AI advice collapses human "I don't know" from 43% to 3% — ValerioCapraro · 2026-10-16
- Uncensored AI Is About Sovereignty, Not Crime, Argues Open-Model Advocate — learnedall · 2026-10-16
- Sherry Turkle's 'Artificial Intimacy': AI is coming for our capacity for attachment — LuizaJarovsky · 2026-10-16