JavaScript, Webassembly, Emscripten, Numerical Methods, Machine Learning.
here. [Note 4] “As of July 2023, the best announced bound on the asymptotic complexity of a matrix multiplication algorithm is O(n².371552) time” [Note 5] [Note 5] https://en.wikipedia.org/wiki/Computational_complexity_of_matrix_multiplication [Note 6] The inspiration for this medium.com piece: