Mathematician gives CMU talk on OpenAI's proof of a non-sofic group
littmath · x · 2026-09-04
A mathematician (@BooleanAnalysis) gave a talk at Carnegie Mellon covering OpenAI's recent proof of the existence of a non-sofic group — a notable moment of AI-generated math entering serious academic discourse.
Thomas Bloom, in amplifying it, argues we should normalize great mathematicians and expositors giving talks about AI-generated work that isn't their own, as the best way to get these ideas "inside the minds of humans."
Related event: CMU Talk Explains OpenAI's Proof of Non-Sofic Groups(2 posts)→
More from Research
- Stanford team launches ScholarCatalyst benchmark for inspiration retrieval — lateinteraction · 2026-10-21
- Holon-S1 predicts gene activity and biomarkers from routine pathology slides — altryne · 2026-10-21
- Three reasons AI is not conscious and may never be, per Nature essay — anilkseth · 2026-10-21
- Aviation tracks every part's provenance — agents can reason over that graph — colinmcnamara · 2026-10-21
- SFT details: instruction/reasoning/code/math mix, synthetic + human traces, no epoching — TimDarcet · 2026-10-21
- Mid-training recipe disclosed: 32k→131k context extension, dropping logit distillation for tokens — TimDarcet · 2026-10-21