<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Computable Authority</title>
    <link>https://www.computableauthority.com</link>
    <description>Research entries and syllabus lectures from the Computable Authority field guide, as they're published.</description>
    <language>en</language>
    <lastBuildDate>Mon, 10 Aug 2026 10:34:19 GMT</lastBuildDate>
    <atom:link href="https://www.computableauthority.com/feed.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>R-01 — What is Computable Authority?</title>
      <link>https://www.computableauthority.com/research/what-is-computable-authority</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/what-is-computable-authority</guid>
      <description>Authority is the right to decide. Computable authority is that same right, expressed so a machine can exercise it inside defined limits — and prove it did.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>R-02 — Why AI Needs Machine-Readable Policy</title>
      <link>https://www.computableauthority.com/research/why-ai-needs-machine-readable-policy</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/why-ai-needs-machine-readable-policy</guid>
      <description>Capable models with no authority layer are not governed systems. They are fast improvisation with an institution&apos;s name attached.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>R-03 — The Policy Versioning Problem</title>
      <link>https://www.computableauthority.com/research/the-policy-versioning-problem</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/the-policy-versioning-problem</guid>
      <description>A decision is only defensible against the rule that was in force when it was made. Almost no institution can produce that rule on demand.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>R-04 — The Definitions Problem</title>
      <link>https://www.computableauthority.com/research/the-definitions-problem</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/the-definitions-problem</guid>
      <description>Most policy disputes are not about rules. They are about what a word meant, to whom, and when.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>R-05 — From Regulation to Execution</title>
      <link>https://www.computableauthority.com/research/from-regulation-to-execution</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/from-regulation-to-execution</guid>
      <description>The compilation pipeline: how a published instrument becomes an artifact a runtime can evaluate — without losing its provenance.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>R-06 — The Future of Governance Infrastructure</title>
      <link>https://www.computableauthority.com/research/the-future-of-governance-infrastructure</link>
      <guid isPermaLink="true">https://www.computableauthority.com/research/the-future-of-governance-infrastructure</guid>
      <description>Institutions will exchange authority the way systems now exchange data — and that requires shared infrastructure, not shared documents. Three prior efforts got partway there; none closed the gap.</description>
      <pubDate>Fri, 07 Aug 2026 14:38:05 GMT</pubDate>
    </item>
    <item>
      <title>1.1 Why Policies Fail Machines</title>
      <link>https://www.computableauthority.com/syllabus/policy-problem/why-policies-fail-machines</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-problem/why-policies-fail-machines</guid>
      <description>The Policy Problem — Modern institutions rely on policies as the primary mechanism for expressing authority. However, policies were designed for human interpretation rather than machine execution. As artificial intelligence systems increasingly participate in institutional decisions, a fundamental challenge emerges: how can authority be represented in a form that machines can execute and independent parties can verify?</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>1.2 The Limitations of Documents</title>
      <link>https://www.computableauthority.com/syllabus/policy-problem/limitations-of-documents</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-problem/limitations-of-documents</guid>
      <description>The Policy Problem — The document is the dominant carrier of institutional authority, and it is a carrier with no defined behaviour. This lecture examines what a document can and cannot do as a governance instrument, and why format modernisation — PDF to HTML to XML — does not by itself close the gap.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>1.3 Human-Readable vs Machine-Readable Authority</title>
      <link>https://www.computableauthority.com/syllabus/policy-problem/human-vs-machine-readable-authority</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-problem/human-vs-machine-readable-authority</guid>
      <description>The Policy Problem — Machine-readability is often treated as a downgrade of legal text. This lecture argues the opposite: the machine-readable form is a second, disciplined expression of the same authority, and the two forms must be governed together.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>1.4 Why AI Creates Urgency</title>
      <link>https://www.computableauthority.com/syllabus/policy-problem/why-ai-creates-urgency</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-problem/why-ai-creates-urgency</guid>
      <description>The Policy Problem — Interpretation has always been unrecorded, and institutions absorbed the resulting variance because human throughput was low. Autonomous systems remove that slack. This lecture examines why the authority layer becomes load-bearing precisely when execution becomes machine-speed.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.1 Policy Decomposition</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/policy-decomposition</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/policy-decomposition</guid>
      <description>Policy Engineering — Decomposition is the first unit operation of policy engineering: reading an instrument and separating it into the elements a machine will need. This lecture establishes the method and the discipline of not resolving ambiguity silently.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.2 Definitions</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/definitions</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/definitions</guid>
      <description>Policy Engineering — Definitions decide outcomes more often than rules do. This lecture treats the definition as the primary object of policy engineering: scoped, versioned, and shared across rules.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.3 Rules</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/rules</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/rules</guid>
      <description>Policy Engineering — A rule is an operative statement binding conditions to a normative outcome. This lecture covers rule form, modality, and the discipline of writing one rule per statement.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.4 Exceptions</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/exceptions</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/exceptions</guid>
      <description>Policy Engineering — Exceptions are where most policy failures live. This lecture treats the exception as a first-class object with its own conditions, authority, and expiry.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.5 Conditions</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/conditions</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/conditions</guid>
      <description>Policy Engineering — A condition is the point at which authority meets fact. This lecture examines evaluability: which conditions a machine can test, which require judgement, and how the boundary is declared.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.6 Decision Logic</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/decision-logic</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/decision-logic</guid>
      <description>Policy Engineering — Decision logic is the evaluable structure that turns facts into an outcome. This lecture covers ordering, completeness, and the requirement that every path terminate in a defined result.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>2.7 Contradiction and Conflict</title>
      <link>https://www.computableauthority.com/syllabus/policy-engineering/contradiction-and-conflict</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/policy-engineering/contradiction-and-conflict</guid>
      <description>Policy Engineering — A decomposition can be complete and still be incoherent. This lecture covers the failure modes that appear only once a policy is expressed as structure — the conflicts prose was able to conceal — and treats their detection as a required step before any artifact is issued.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.1 The Second System</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/the-second-system</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/the-second-system</guid>
      <description>The Observed System — Every institution operates two decision systems: the one it has documented, and the one it actually runs on. This lecture establishes that the divergence between them is structural rather than pathological — a property of how institutions work, not evidence that a particular one is failing.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.2 Decision Boundaries</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/decision-boundaries</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/decision-boundaries</guid>
      <description>The Observed System — If the operating system is not a set of written rules, what is it made of? This lecture introduces the decision boundary — the point at which an institution&apos;s answer changes — as the unit that makes an unwritten system measurable rather than merely acknowledged.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.3 Evidence and Admissibility</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/evidence-and-admissibility</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/evidence-and-admissibility</guid>
      <description>The Observed System — Reconstruction is only as sound as the record it rests on. This lecture treats a decision log as evidence subject to admissibility tests, and establishes the conditions under which a body of decisions can support any claim about a boundary at all.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.4 Reconstruction</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/reconstruction</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/reconstruction</guid>
      <description>The Observed System — Given admissible evidence, the operating system can be reconstructed as a structured approximation. This lecture states the extractability thesis — that a latent decision system can be inferred from behaviour — and, just as importantly, the limits of what such inference can establish.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.5 Reconciliation</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/reconciliation</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/reconciliation</guid>
      <description>The Observed System — Reconstruction produces a second description of the same institution. Reconciliation compares the two. This lecture argues that the comparison must be made boundary to boundary rather than text to text, and that agreement is as significant a result as divergence.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>3.6 Adjudication</title>
      <link>https://www.computableauthority.com/syllabus/observed-system/adjudication</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/observed-system/adjudication</guid>
      <description>The Observed System — A divergence is a fact. Whether it is a problem is a further claim requiring further evidence. This lecture separates detection from adjudication and sets the standard of proof required before an institution is told that its practice is causing harm.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>4.1 Policy Compilation</title>
      <link>https://www.computableauthority.com/syllabus/executable-authority/policy-compilation</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/executable-authority/policy-compilation</guid>
      <description>Executable Authority — Compilation converts a decomposed policy into an executable authority artifact. This lecture treats compilation as a governed act with inputs, review, and issuance — not a file conversion.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>4.2 Deterministic Execution</title>
      <link>https://www.computableauthority.com/syllabus/executable-authority/deterministic-execution</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/executable-authority/deterministic-execution</guid>
      <description>Executable Authority — Determinism is what makes an outcome auditable: the same artifact and the same facts must produce the same outcome on any conforming runtime, today and years from now.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>4.3 Verification</title>
      <link>https://www.computableauthority.com/syllabus/executable-authority/verification</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/executable-authority/verification</guid>
      <description>Executable Authority — Verification is confirmation by a party who did not execute the decision. This lecture examines what must be recorded for verification to be possible without access to the executing system.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>4.4 Policy Versioning</title>
      <link>https://www.computableauthority.com/syllabus/executable-authority/policy-versioning</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/executable-authority/policy-versioning</guid>
      <description>Executable Authority — Every decision was made under some version of the rules. This lecture covers immutable issuance, effective dates, and replaying past decisions against past authority.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>4.5 Governance APIs</title>
      <link>https://www.computableauthority.com/syllabus/executable-authority/governance-apis</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/executable-authority/governance-apis</guid>
      <description>Executable Authority — If authority is executable, it must be callable. This lecture covers the interface through which systems request an authority evaluation and receive a bound, traceable outcome.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>5.1 AI-Native Institutions</title>
      <link>https://www.computableauthority.com/syllabus/future-of-authority/ai-native-institutions</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/future-of-authority/ai-native-institutions</guid>
      <description>The Future of Authority — An institution whose authority is computable by default operates differently: rules ship as artifacts, human and machine actors share one source of authority, and change propagates through issuance rather than memo.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>5.2 Regulatory Interoperability</title>
      <link>https://www.computableauthority.com/syllabus/future-of-authority/regulatory-interoperability</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/future-of-authority/regulatory-interoperability</guid>
      <description>The Future of Authority — Authority does not stop at a border. This lecture examines what is required for artifacts issued by different jurisdictions to be evaluated together without collapsing their differences.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>5.3 Computable Authority</title>
      <link>https://www.computableauthority.com/syllabus/future-of-authority/computable-authority-lecture</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/future-of-authority/computable-authority-lecture</guid>
      <description>The Future of Authority — Returning to the umbrella discipline with the full apparatus in hand: what has been built across the curriculum, and what computability of authority actually claims — and does not claim.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>5.4 Policy Ecosystems</title>
      <link>https://www.computableauthority.com/syllabus/future-of-authority/policy-ecosystems</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/future-of-authority/policy-ecosystems</guid>
      <description>The Future of Authority — Artifacts do not exist alone. This lecture examines registries, dependencies, and what happens when one institution&apos;s artifact becomes another&apos;s input.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
    <item>
      <title>5.5 The Future Role of Policy Engineers</title>
      <link>https://www.computableauthority.com/syllabus/future-of-authority/future-role-of-policy-engineers</link>
      <guid isPermaLink="true">https://www.computableauthority.com/syllabus/future-of-authority/future-role-of-policy-engineers</guid>
      <description>The Future of Authority — The discipline needs practitioners. This lecture describes the emerging role: its competencies, its position between legal and engineering functions, and the professional questions still unanswered.</description>
      <pubDate>Fri, 07 Aug 2026 13:46:48 GMT</pubDate>
    </item>
  </channel>
</rss>
