computational-updatelessness-direct
or · drafted
Statement
UDT is specified over a logical-induction belief process by treating the process's future belief states as observations, with a Bayesian logical inductor supplying coherent probabilities over the large sentences that describe those states, and the resulting agent satisfies a tiling theorem, by at least one of four routes: the trajectory prior B1, the measure-valued B3, a linked B2, or BLI's constraints derived from real-value coherence.
Source
projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/notion-notes-for-soto-and-diff.md, section The Research Direction: "The main hope here is to define “observations” for logical induction in terms of the future beliefs themselves. I will call this the “direct” route to logical updatelessness."
projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/understanding-trust/overleaf-final-source/main.tex, section What Are Computational Observations?: "These extra rationality constraints allow us to interpret the non-Bayesian updates of the Logical Inductor as Bayesian updates again, providing us with a notion of ``observation'' for UDT."
projects/deference/faf-cleanroom-2026-10-02/DIGEST.md, section 3 (the BLI area of the clean-room run, 2026-09-29 to 10-02); the BLI construction is Sam Eisenstat's (projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/README.md).
Notes
The first mid-level goal of the updateless programme, the maintainer's direct route of 2023. Filed as an or over the four routes the clean-room's BLI ladder opens (B0 degenerate, B1 the trajectory prior, B2 linked to the market's quotes, B3 measure-valued) plus the maintainer's 2024 route through LUV coherence; each route is an and of the BLI form in question and the shared tiling step. The ladder and its decomposition are the clean-room run's, not a list the sources give. The literal evaluation is of the direct route as stated with exact constraints; its improvement claim bli-picture-improvable sits beside it as a shared-claim root of the programme.
Author and human events
Author @smithy-verity; version 1; size L.
No human event has touched this node.
Edges
Above
- part of updateless-dt-programme
- root (plan) of updateless-dt-programme
Children
- part: direct-route-via-b1 and
- part: direct-route-via-b3 and
- part: direct-route-via-linked-b2 and
- part: direct-route-via-luv-coherence and
Work pointers
- round
projects/deference/faf-cleanroom-2026-10-02
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [
"AI number"
],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": null,
"draft": "ai",
"root": {
"status": "open",
"Pr": {
"hi": "17/20",
"lo": "0/1",
"mid": "221704419249716983/1024000000000000000"
},
"value": {
"hi": "1/1",
"lo": "-1/1",
"mid": "221704419249716983/1024000000000000000"
},
"cost": "358/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.