Report
OpenAI reportedly proved an O(n^2.25) matrix-multiplication result without finding an algorithm
A user says the nonconstructive proof beats the previous O(n^2.37) record but does not produce an algorithm.
TLDR
A user claims OpenAI proved matrix multiplication can be done in O(n^2.25) operations, improving on a previous O(n^2.37) record. The proof is nonconstructive, the user says: it shows an algorithm must exist without identifying one. The user calls the result especially concerning because AI systems run on matrix algebra.
Combined views
—
1 Source, first seen ago
