JohnKemeny
Joined 4 years ago
Joined 4 years ago
This is not written by Tao, but by Álvaro Lozano-Robledo.
They are just putting out a bunch of weirdly written extremely long and technical papers and saying: Hey, here is the solution (we hope there are no mistakes).
Is really a recursive implementation of Fib an enlightening benchmark? I don't think so. And bubblesort is just messing around with two pointers.
Why not, if you're first doing benchmarking, find out what the most time consuming popular operations/algorithms are, and then use them?
Now it seems that you are just testing two obscure algorithms that are not really representative for Python coding in general.
It's a keylogger in the same way Vim is a keylogger.
Or are you saying that neural networks in general cannot (practically) be trained to be an above-average chess player?
Or are you saying that it depends on the input? Would it be better if they were given a picture/drawing/ascii art of the board? If so, surely they can produce it at will?
> The main branch of formal-conjectures does not contain the path `FormalConjectures/Millenium/NavierStokes.lean.`