in a specific case I was interested in (point cloud compression for geometry streaming on the network), claude helped me make something that is 200-300x faster than the existing standard (MPEG G-PCC) at 10-20% worse compression ratio, which opens completely different use cases. e.g. the MPEG one compresses a 3.2 M points point cloud to 8.94 megabytes in ~5.7 seconds and decodes it in 3.7 seconds ; https://github.com/sat-mtl/pccl encodes to 9.97 megabytes in 32 milliseconds and decodes in 12ms.
Same with gradient descent
The fix to this are better benchmarking environments without reward hacks, as well as formal verification of code on various levels. There is crazy much work on this at the moment.
The fact that I can implement any stupid idea I've ever had and I'll ever have is ground breaking for me.
> What about creating Rust compiler which runs 10x faster than rustc?
For now we have many times faster TypeScript compilers written in Rust by AI. There's zero doubt that things like that will come in abundance.
Not an expert, but from comments I've heard by experts P != NP is much further out of reach than Riemann. Eg, Scott Aaronson:
> First, almost no one in theoretical computer science—not counting the cranks, whose missives fill my inbox every week!—spends their time directly trying to prove P≠NP. Why not? For the same reason why you wouldn’t embark on a manned mission to another galaxy, if you hadn’t even set foot on Mars yet.
If you call any computer program that's advanced "AI" and stick the "software" label only on dumb programs, well of course software seems dumb. You defined it as such.