Rust AI CFP
Fill out a form to propose a talk!
Fill out a form to propose a talk!
A newspaper that prints each day as coordinates in the eigenbasis of a quarter-century of news—recurring archetypes, the daily decomposition, and what is different this time—built two ways and compared.
We ran the verified meander-counting machine as fast as two languages could take it. OxCaml took the lead, our first explanation was wrong, and one experiment let Rust catch up and count 50 crossings.
Arnold asked in how many ways a river can cross a road n times. Nobody has a formula, so we counted the rivers with programs proved correct in Lean 4: every value up to 32 crossings, a paper on First Pair, and a film.
TPC-DOOM measures the speed of the fastest databases