@nasqret Regarding the Google circuit we only know in what kind of bounded region some of its parameters belong. They didn’t prove exact values, only upper bounds.
I remember proving f(2) = 1 long time ago. true about showing f(k²) = k is easy.
This belongs to a pretty interesting set of combinatorial geometry problems by Erdös and friends ... ⊞
@wtgowers@hrkrshnn Love that the chain of thoughts is 125 pages but the final response from the internal model is about 2 pages.
Haven’t read in details but found a tiny typo …
AI has now solved a major open problem -- one of the best known Erdos problems called the unit distance problem, one of Erdos's favourite questions and one that many mathematicians had tried.
https://t.co/SD1vVPkrHR
@tonylfeng The question of decidability and potentially creating an efficient algorithm to differentiate DGAs comes in handy since if found/proven it would help understand whether 2 topological/geometrical objects in a category are different if their related DGA invaraints are ...
@tonylfeng The 5.16 problem although related to invariants of specific classes of links for example, in the way it is stated is purely algebraic and about decidability exactly.
I guess the commutative case is not fully proved?