~/talk

Return of the Theorem

links:none on file
slides:none on file

Claims that AI agents must be treated guilty until proven safe and that every proposed action is deferred until a verifier proves it fits formal business rules. Uses Horn clause logic (Universalis-style guarded clauses), SMT solver (Z3) and classic taint-analysis to check agent-generated plans as set-inclusion against formalized rules. Demonstrates prevention of $1 car sales, unauthorized purchases, keylogger exfiltration and data leaks by rejecting plans without proofs; architecture auto-formalizes requests, has the model produce a program plus proof, and only executes verified plans.

AI-written summary · about

  1. 0:00Speaker Introduction
  2. 1:18Coding Is a Solved Problem
  3. 3:06Real-World AI Agent Failures
  4. 6:13Guilty Until Proven Safe
  5. 8:54Defer, Verify, Then Execute
  6. 10:37Formal Specs and SMT Solvers
  7. 16:45The Verification Architecture
  8. 19:22Why Not Lean or Python?
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.