Tag
OpenAI's AI model disproved the Erdős unit distance conjecture, a famous problem in discrete geometry that had stumped mathematicians for 80 years, marking a milestone in AI mathematics.
An OpenAI researcher claims that their model's solution to an Erdős problem in discrete geometry is the biggest AI achievement to date, but predicts it will be overshadowed by end of year.
An internal OpenAI model achieved a breakthrough in the unit distance problem, a famous open conjecture in discrete geometry that had seen no progress in 80 years, by finding a new construction beating the grid's bound.
OpenAI's general-purpose reasoning model autonomously solved the planar unit distance problem, a famous open problem in mathematics posed by Paul Erdős in 1946, marking the first time AI has independently solved a prominent open problem in a field of mathematics.
An OpenAI model autonomously disproved a central conjecture in discrete geometry known as the unit distance problem, marking the first time an AI has solved a prominent open problem in mathematics.
An OpenAI model has autonomously solved the planar unit distance problem, a famous open question in mathematics posed by Paul Erdős in 1946, by discovering a new family of constructions that outperform square grids. This marks the first time AI has autonomously proven a prominent open problem in mathematics.