i will have to probably leave by 6:30pm at the latest :|

when does this event end?

I am a bit sick today but the meetup will happen regardless.

Actually, not going at all. Scheduling conflict.

(To organizer: Sorry for switching to "Can't Go" and back; I thought this was on the wrong day. I might be able to make this.)

The single biggest question I have is "what is Dirichlet?"

I might come if the venue wasn't a bar

To be fair, there is no evidence requirement for upvoting, either.

I could see why someone would want this (eg Reddit's upvote/downvote system seems to be terrible), but I think LW is small and homogenous-ish enough that it works okay here.

"AI that can verify itself" seems likely doable for reasons wholly unrelated to metamathematics (unlike what you claim offhandedly) since AIs are finite objects that nevertheless need to handle a combinatorially large space. This has the flavor of "searching a combinatorial explosion based on a small yet well-structured set of criteria" (ie the relatively easy instances of various NP problems), which has had a fair bit of success with SAT/SMT solvers and nonconvex optimizers and evolutionary algorithms and whatnot. I don't think constructing a system that systematically explores the exponentially big input space of a neural network is going to be too hard a challenge.

Also, has anyone really constructed a specific self-verifying theory yet? (It seems like from the English Wikipedia article, if I understand correctly, Dan Willard came up with a system where subtraction and division are primitive operations with addition and multiplication defined in terms of them, with it being impossible to prove that multiplication is a total function.)