17:32 I'm not getting this - we already have probabilistic programming languages with unbounded numbers of random variables and stochastic recursion. There's an entire field of ML called Bayesian non-parametrics that deals with this. We can also express finite element solvers in those languages, so there's no reason we can't use PDEs in our models (and even backpropagate through them).
@nowithinkyouknowyourewrong867512 сағат бұрын
It's about using coq/lean4 and then bring able to say, get the best solution to making a fusion plant with garuntees of safety and this risk budget
@nowithinkyouknowyourewrong867512 сағат бұрын
And most importantly it's about making that easy to verify
@jatelitherius9842Күн бұрын
This was an awesome talk. I hope the techonogies & methods he mentioned can be implemented before its too late. A lot of the technical parts went over my head, but i followed the gist. I want to remain hopeful but i’m scared
@PauseAIКүн бұрын
Thank you for doing this highly important work, Davidad!
@dizietz6 сағат бұрын
I loved the talk, but defining the formal specification has always been the Achilles heel of formal verification!
yeah, but when all the mostly free products that 10,000,000+ people already use, like 'paradot' just literally have no problem lying to game their own prosaic alignment on a post by post basis millions of times a day whereby the developers dont even care, "what is even the point?", etcetera. ...