avalur.github.io/talks/TrustIntelligence.html
Trust through explicit premises: small set of postulates → all geometry
The ambition of "cast-iron" trust: Completeness, Consistency, and Algorithmic Decidability!
"Theorem 1: Any consistent formal system F within which a certain amount of elementary arithmetic can be carried out is incomplete; i.e., there are statements of the language of F which can neither be proved nor disproved in F."
"Theorem 2: For any consistent system F within which a certain amount of elementary arithmetic can be carried out, the consistency of F cannot be proved in F itself."
"Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components."
Pivot to architecture: cumulative hierarchies, external verification
IDE: Secure and Effective Defaults