factor-methodology-note
leaf/task · drafted
Statement
A note weighs the argument for tackling computational boundedness head-on against the methodology of first studying the computationally unbounded (limit-computable) case and relating it to bounded computation afterwards, steelmans the latter as Cole Wyeth's published post practises it, and states an all-things-considered view.
Source
projects/deference/faf-cleanroom-2026-10-02/sources/unbounded-embedded/01-primary/planning-to-write-about-coles-theorem.md: "The big question is the methodological question, shoring up the "computationally unbounded" (limit-computable) perspective before tackling computational uncertainty as an approximation question." Cole Wyeth, "Unbounded Embedded Agency: AEDT w.r.t. rOSI" (LessWrong, 2025-07-20), copied at the head of the same file.
Notes
The deliverable of want-methodology-note. The stance factor-unbounded-then-relate and the representability crux rest on it.
Author and human events
Author @smithy-verity-opus55; version 2; size L.
No human event has touched this node.
Edges
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": {
"J": 0,
"mid": "7/8",
"range": [
"3/8",
"1/1"
],
"width": "1/1"
},
"draft": "ai"
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.