pic-sharp-obstruction
leaf/picture · drafted
Statement
A sharp impossibility theorem rules out every computationally uncertain UDT of the claim's form over logical-induction-like processes.
Source
projects/deference/faf-cleanroom-2026-10-02/sources/references/bli/soto-2023 (the 2023 impossibility-results and foundational-problem PDFs), projects/deference/faf-cleanroom-2026-10-02/packages/bli-exactness/bli-exactness-report.md (exact reflection fails on the diagonal liar) and projects/decision-theory/rounds/2026-09-29-li-bria-synthesis-spec/PROBLEM_STATEMENT.md, section 4 (P1').
Notes
None of the cited results is an impossibility for the claim as stated; each kills one natural form.
Author and human events
Author @smithy-verity; version 1; size S.
No human event has touched this node.
Edges
Above
- part of li-updatelessness-tractable
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"
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.