Lecture 6.3
Computable authority is not the first attempt to make law machine-tractable, and it does not replace the work that exists. This lecture situates it against Akoma Ntoso, LegalRuleML, Catala, the Rules-as-Code movement, and the emerging work on agent identity — what each does well, and the specific gap computable authority is aimed at.
Learning objectives
After this lesson, the reader should understand:
Concept framework
The field, and the gap
Case study
A tax rule is implemented in Catala with formal guarantees that it matches the statute. An agent invokes it and acts on the result. What is still missing?
The authority relationship around the invocation. Catala establishes that the computation is faithful to the law — a hard and valuable property. It does not establish which system is authorised to invoke that computation, under whose delegation, against which version of the institution's policy, or with what evidence. Akoma Ntoso would give the source a clean structure; LegalRuleML would represent the norm's logic; neither says the agent may act on it. Each standard solves a real layer. Computable authority is the layer that binds a faithful rule to an authorised actor at runtime — and it depends on the others rather than displacing them.
Discussion questions
Exercise
Place one of your instruments across the layers.
Research notes