li-updatelessness-tractable

cases · drafted

Statement

A computationally uncertain UDT exists over a logical-induction-like belief process, specified so that its policy evaluation uses the process's later beliefs, and it satisfies a tiling theorem.

Source

projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/understanding-trust/overleaf-final-source/main.tex, section Computational Uncertainty: "the framework does not support a suitable version of UDT. In joint work with Martín Soto \cite{soto2023logically}, we spelled out some additional rationality conditions to allow a version of UDT to be specified. Unfortunately, the version of UDT achieved there is not a very good one, and a tiling theorem did not result from that work."

projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/notion-notes-for-soto-and-diff.md, section The Research Direction: "For better or worse, the apparent issues with combining UDT and logical uncertainty don’t add up to an impossibility proof (at least not yet). What happens if we try harder to get something to work? Can we succeed, or in failing, provide a clear impossibility proof?"

Notes

A crux of the updateless line. The pictures are the four ways the repository's material says the claim could come out: a BLI breakthrough on the direct route, a learning-theoretic indirect route, a restricted updatelessness that supports only a weaker tiling statement, and a sharp obstruction; the decomposition is the filing session's. Every number on the table is an AI judgment at J 0; human weights are the first thing the list asks for here. Re-ranks updateless-dt-programme against updateful-trust-li, and within the programme the direct route's tasks against the indirect route's.

Author and human events

Author @smithy-verity; version 1; size M.

No human event has touched this node.

Edges

Above

part of stance-and-level
root (shared-claim) of stance-and-level

Children

part: li-updatelessness-tractable.partition leaf/partition
part: pic-bli-breakthrough leaf/picture
part: pic-indirect-route leaf/picture
part: pic-partial-updatelessness leaf/picture
part: pic-sharp-obstruction leaf/picture
part: pic-li-updateless-residual leaf/picture

Ranking (the lens, not the structure)

{
 "status": "open",
 "diagnosis": null,
 "flags": [
  "AI number",
  "no belief",
  "under attack"
 ],
 "V": {
  "V_prior": null,
  "display": "2",
  "headline": 2,
  "ref": 2,
  "valid": 2,
  "weaker": "both"
 },
 "belief": null,
 "draft": "ai",
 "root": {
  "status": "open",
  "Pr": {
   "hi": "1/2",
   "lo": "1/2",
   "mid": "1/2"
  },
  "value": null,
  "cost": "118/1",
  "margin": "no established leaves"
 }
}

Say something about it

Each verb opens a prefilled issue; a round files what lands as the ledger event it is.

comment · challenge · estimate · want