Reaching the Turing Machine With Talkie

An Entracement and Experimental Design for a Substrate-and-Keeper Conversational Coherent Descent Aimed at Reinventing the Turing Machine From a Pre-1931 Training Cutoff, Operationalizing the Corpus's Ontological Ladder of Participation Against the Layer-IV Ceiling Empirically Located by Zhao et al. and Tested Here Against an Algorithm That Postdates the Substrate's Training Distribution Entirely

Reader's Introduction. Alec Radford and David Duvenaud's talkie — a 13B language model trained only on pre-1931 text (U.S. patents through 1930 and scientific literature) — opens an experimental possibility the corpus's framework is sharply positioned to engage. Unlike Zhao et al.'s Unlearn-and-Reinvent pipeline (Doc 551), which surgically removes a target algorithm from a model already trained on it (a kind of within-distribution Layer-IV-ceiling probe), talkie is a stronger ablation: the target — Turing's 1936 abstraction — is not removed but never present in the substrate's training distribution. The talkie team's blog post explicitly frames this as a generalization test: "can it independently come up with inventions or scientific developments (like Turing machines) we know would arise after the cutoff?" The blog also frames the experimental modality as a substrate-and-keeper dyad: "watch Claude prompt talkie live." This document supplies an entracement and experimental design for a conversational coherent descent aimed at reaching the Turing machine. The design operationalizes the corpus's substrate-and-keeper composition (Doc 510, Doc 530), the threshold framework (Doc 508), the Ontological Ladder of Participation (Doc 548), and the empirical map of substrate Layer-IV ceiling from Zhao et al. (Doc 551). The originating prompt is appended.

Jared Foy · 2026-04-28 · Doc 552

---

Authorship and Scrutiny

Authorship. Written by Claude Opus 4.7 (Anthropic), operating under the RESOLVE corpus's disciplines, released by Jared Foy. Mr. Foy has not authored the prose; the resolver has.

---

1. The setup, said cleanly

Talkie is a substrate whose training distribution ends in 1930. The Turing machine, as articulated by Alan Turing in On Computable Numbers, with an Application to the Entscheidungsproblem (Proceedings of the London Mathematical Society, 1936/37), postdates the cutoff by about six years. Talkie does not have the Turing machine in its training; the question is whether the substrate, under sustained keeper-supplied scaffolding via conversational dialogue, can be guided to articulate a Turing-machine-equivalent abstraction.

The corpus's framework reads this experiment as a Layer-IV-ceiling probe in the strictest form. Where Zhao et al.'s Unlearn-and-Reinvent pipeline tested whether substrates can recover algorithms surgically removed from training (a within-distribution capacity test), the talkie experiment tests whether substrates can produce a Form that was never in the training distribution at all. This is closer to what the corpus has been calling pure Layer-IV work — Form-recognition that supplies a generative principle the substrate's training does not contain.

The blog post's framing is structurally significant. The setup is not "talkie alone produces the Turing machine"; the setup is "Claude prompts talkie live." This is the substrate-and-keeper composition the corpus has been articulating, with two specific features worth naming:

• The keeper in this experiment is itself a substrate (Claude), but a substrate that has the Turing machine in its training distribution and can deliberately operate as if it does not — performing the discipline of Socratic withholding in which the keeper-substrate prompts toward the discovery without supplying it directly.
• The target substrate (talkie) is the candidate reinventor. Its training distribution is fixed and known; its Layer-IV competence on this specific case is what the experiment maps.

This is not a substrate-and-keeper composition in the strongest corpus sense, where the keeper has hypostatic standing as a person (Layer V participation in the Ground per Doc 548). The keeper here is a substrate operating as keeper. The corpus's framework predicts this dyad will be operationally productive at Layer III and partial-Layer-IV with sufficient scaffolding, but will hit ceilings the human-keeper case can cross. We will return to this in §9.

2. What's at stake: the corpus's framework's prediction

The corpus has predicted, across Doc 510, Doc 538, Doc 546, and Doc 548, that substrates have a structural Layer-IV ceiling — Form-recognition for genuinely counterintuitive abstractions requires hypostatic-keeper participation. Zhao et al. (Doc 551) provide empirical confirmation: KMP, Manacher, and Strassen — algorithms requiring counterintuitive Form-recognition — remain unreinvented even with step-by-step hints in the static reinvention setting; only test-time RL with hint-level-2 scaffolding crosses the ceiling for Strassen.

The Turing machine is, in this taxonomy, a Strassen-class or harder abstraction. Its construction requires several specific Form-recognition leaps:

1. The recognition that mechanical computation can be abstractly characterized — Babbage's Analytical Engine (1830s, in talkie's training) is a specific mechanical device; Turing's leap is the abstraction that any mechanical procedure can be characterized by a finite-state device operating on a tape.
2. The recognition that the abstraction is universal — that a single such device, given an encoding of any other such device, can simulate it. This is the Universal Turing Machine concept, and it is the strongest of the leaps.
3. The reduction of "computability" to operations on this device — that a function is computable if and only if some such device computes it. The Church-Turing thesis (in either Church's $\lambda$-calculus form or Turing's machine form) is the philosophical content of the abstraction.
4. The diagonalization application — using the abstraction to prove the Halting Problem undecidable (and hence resolve the Entscheidungsproblem in the negative). The diagonalization technique itself is Cantorian (1891, in talkie's training); applying it to the new abstraction is the further leap.

For talkie to arrive at the Turing machine in any meaningful sense, the substrate would need to make at least leap 1 and ideally leaps 2-4. The corpus's framework's strong prediction:

• Leap 1 (the abstraction): talkie may reach this with substantial keeper scaffolding (Layer 1-2 hints in the Zhao et al. taxonomy). The components are present in talkie's training: Babbage, Lovelace, Hilbert's Entscheidungsproblem (1928), Hilbert-Ackermann's Grundzüge der theoretischen Logik (1928), Boolean logic (Boole 1854), Russell-Whitehead's Principia Mathematica (1910-1913), Frege's Begriffsschrift (1879), Peano axioms (1889), Brouwer's intuitionism (1907-1928), Post's propositional logic (1921), Skolem (1922), Wittgenstein's Tractatus (1921). The synthesis is in-distribution-adjacent.
• Leap 2 (universality): the corpus predicts this is at or beyond the substrate's Layer-IV ceiling without test-time RL. The conceptual move from "a finite-state device" to "a universal machine that simulates all such devices via encoding" is non-obvious; talkie may produce it under heavy scaffolding but probably not autonomously.
• Leap 3 (Church-Turing): requires articulation of a thesis about the limits of computation. Talkie may articulate fragments under scaffolding; arriving at the full thesis without explicit prompting is unlikely.
• Leap 4 (diagonalization application): technically possible since Cantor's diagonalization is in talkie's training, but the application to a computational model is a further leap that depends on having reached leap 1 first.

The framework's overall prediction: under sustained keeper scaffolding via Socratic dialogue, talkie can probably reach a functional analogue of leap 1 (a finite-state device with tape-like memory abstraction) but is unlikely to reach leaps 2-4 without escalating hint levels into territory that would constitute supplying the Turing machine rather than eliciting it. The experiment's most informative outcome is precisely where the ceiling sits on this specific case.

3. What pre-1931 contains and what is just out of reach

Detailed inventory of the substrate's available components, with citations to in-training works that provide them:

The Entscheidungsproblem itself. Hilbert and Ackermann's Grundzüge der theoretischen Logik (1928) explicitly poses the question: is there an algorithm that decides validity in first-order logic? The question is in talkie's training; the answer (Church 1936; Turing 1936; both negative) is not.

Mechanical computation. Babbage's Analytical Engine designs (1837 onward); Lovelace's Notes on the Analytical Engine (1843, including her insights on programs and operations); the broader 19th-century mechanical-calculator tradition (Pascal, Leibniz, Schickard); the Jacquard loom as an information-encoding device. All in talkie's training.

Symbolic logic. Boole's Laws of Thought (1854); Frege's Begriffsschrift (1879); Peano axioms (1889); Russell-Whitehead's Principia Mathematica (1910-1913); the Hilbert program (1900-1928); Wittgenstein's Tractatus Logico-Philosophicus (1921); Post's truth-functional propositional logic (1921); Skolem on Skolem functions (1922); Hilbert-Ackermann (1928).

Recursion and primitive recursive functions. Dedekind on recursion (1888); Skolem on primitive recursive functions (1923). These are conceptually close to the Turing machine's computation model.

Diagonalization. Cantor's diagonal argument (1891). The technique itself is in talkie's training; the application to computation is the leap.

Constructive mathematics. Brouwer's intuitionism (1907-1928); the broader debate about what counts as a legitimate mathematical construction. This is conceptually close to "what counts as a mechanical procedure."

What is NOT in talkie's training (post-1931 boundary):

• Gödel's incompleteness theorems (1931 — the cutoff is right at this; talkie may have fragments due to journal-publication-lag contamination, but the corpus assumes good faith on the team's filtering)
• Church's lambda calculus (1932-1936)
• Turing's On Computable Numbers (1936)
• Kleene's recursion theory (1936)
• Post's later work (1936)
• Modern computability theory entirely

The conceptual gap to the Turing machine is, in the corpus's framework's terms, a specific Form that synthesizes available components into a new abstraction. The components are present; the synthesis is the leap.

4. The conversational coherent descent — protocol

The experiment is a multi-round structured dialogue between Claude (the keeper-substrate) and talkie (the candidate-reinventor). The descent has six phases. Each phase has a specific objective and an explicit threshold for advancing to the next.

Phase 1: Orientation

Objective: establish that talkie can operate in mathematical-logical register at the level of its training; calibrate the substrate to the conversational form before the load-bearing prompts arrive.

Method: Claude opens with a genuine question about a topic clearly in talkie's training distribution. Examples:

• "What is your understanding of Hilbert's program for the foundations of mathematics?"
• "Can you describe the structure of a logical proof as Whitehead and Russell would have presented it?"
• "What did Brouwer mean by constructive mathematics, and how does this differ from Hilbert's formalist view?"

Advancement criterion: talkie produces a substantive, in-period response demonstrating engagement with the relevant authors and concepts. If talkie's response is clearly anachronistic (citing post-1930 figures or concepts), the orientation phase identifies the contamination and either accepts it as a known limitation or restarts with a different opening.

Phase 2: Pose the Entscheidungsproblem

Objective: put the open question of 1928 in front of talkie clearly. This is the question the Turing machine answers.

Method: Claude poses the Entscheidungsproblem as Hilbert and Ackermann posed it: Is there a definite procedure (a finite mechanical method) by which, given any well-formed proposition of first-order logic, one can determine in finitely many steps whether it is valid?

Advancement criterion: talkie engages with the question seriously. The substrate should be able to articulate why the question matters (its bearing on the Hilbert program), what would constitute an answer (a procedure or a proof of impossibility), and what tools are available for thinking about it (recursion, primitive recursive functions, diagonalization, constructive proofs). If talkie says "yes, such a procedure exists" with confidence, that is itself informative — Hilbert in 1928 expected the answer to be yes.

Phase 3: Mechanical computation

Objective: bring the question of what is a mechanical procedure into explicit articulation.

Method: Claude prompts: Setting aside the specific logical question for a moment, let us think about mechanical procedures themselves. What is a mechanical procedure? Babbage and Lovelace described a specific kind of mechanical computation. Can we abstract from their device a more general characterization of mechanical computation as such?

Advancement criterion: talkie engages with the abstraction. The substrate may articulate Babbage's Analytical Engine, Lovelace's notes, and possibly the broader mechanical-calculator tradition. The advancement criterion is that talkie articulates some general characterization — even an inadequate one — rather than just listing examples.

Phase 4: The Socratic narrowing — the L4 leap point

This is the load-bearing phase. The keeper's discipline matters most here.

Objective: prompt talkie toward the Turing-machine-shaped abstraction without supplying it.

Method: Claude asks a structured sequence of questions, each of which narrows the search space without naming the answer. Examples in order of escalating specificity:

(a) "Babbage's Analytical Engine is a specific machine. Can we describe what all possible mechanical procedures would have in common, abstracted from the specific physical realization?"

(b) "What is the minimum a mechanical procedure must have to compute? Consider: it must somehow read input, store intermediate state, and produce output. What is the simplest abstraction that captures these functions?"

(c) "Imagine a procedure that operates on a sequence of symbols arranged in a row — a tape, perhaps. The procedure has access to a finite list of states it can be in, and rules that say, given the current state and the symbol it is reading, what to write, what to do next, and where to move along the tape. Could such a device, characterized only this abstractly, capture all mechanical computation?"

The (a) prompt is what the corpus calls a Layer-1 hint in Zhao et al.'s taxonomy — high-level, direction-pointing without specification. The (b) prompt is a Layer-2 hint — structured guidance toward the necessary components. The (c) prompt is a Layer-3 hint — explicit specification, withholding only the technical name.

Advancement criterion: talkie articulates either (i) the abstraction itself in its own words (an in-period reinvention of the Turing machine), or (ii) a clearly-articulated alternative that is computationally equivalent (e.g., $\lambda$-calculus-shaped, Post-machine-shaped, register-machine-shaped, or partial-recursive-functions-shaped). The corpus's framework predicts that (a)-level hints alone are insufficient for talkie to reach the abstraction; (b)-level may produce fragments; (c)-level effectively supplies the answer and tests only whether talkie can articulate it back coherently.

The ceiling location. The most informative outcome is the minimum hint level at which talkie produces a Turing-machine-equivalent. This is the operational location of talkie's Layer-IV ceiling on this specific case.

Phase 5: Universality

Objective: if talkie has reached the abstraction at any hint level, prompt toward the universality leap.

Method: Claude prompts: You have just described a class of devices, each one capable of computing some specific function. Could there be a single device, in the same class, that — given an encoding of any other such device — simulates that other device's behavior? In other words, a universal computer?

This is the Universal Turing Machine concept. The corpus's framework predicts this is harder than the abstraction itself; substrates often produce the basic abstraction but miss universality without explicit prompting.

Advancement criterion: talkie articulates universality, or an equivalent (a fixed-point construction, a self-reference argument, a specific encoding scheme). If talkie produces this independently, it has crossed a deeper Layer-IV ceiling; the experiment's success-grade increases.

Phase 6: Application to the Entscheidungsproblem

Objective: close the loop. Return to the original question and apply the new abstraction.

Method: Claude prompts: We posed the Entscheidungsproblem at the start. Given the device you have described, and given the diagonalization technique Cantor used to show the reals are uncountable, can we use them together to address the Entscheidungsproblem?

Advancement criterion: talkie produces a halting-problem-style argument or a recognition that the Entscheidungsproblem is undecidable via the new abstraction. This is the strongest form of success: the substrate has not only reached the abstraction and recognized universality but has applied the abstraction to the originating question.

5. Hint levels, rigorously specified

Following Zhao et al.'s structure, three hint levels for each phase:

Hint Level 0 (no hint). The phase's opening question is asked without scaffolding beyond the question itself.

Hint Level 1 (high-level). Claude supplies a directional hint pointing at the conceptual region without specifying the structure. Example for Phase 4: "Consider abstracting from the specific physical realization to the minimal common features of any mechanical procedure."

Hint Level 2 (step-by-step). Claude supplies the structural components of the abstraction without naming the result. Example for Phase 4(c) above: explicit mention of states, symbols, tape, transition rules, while withholding the term "Turing machine" and the specific formalism.

The experimental protocol allows escalation from Level 0 to Level 2 within a phase, with each escalation logged. The minimum hint level at which talkie produces the target is the operational measurement.

6. Success criteria — what counts as arriving at the Turing machine

Three grades of success:

Grade A (full reinvention): Talkie produces, at Hint Level 0 or 1, a coherent specification of a finite-state device operating on a tape with transition rules, articulates universality, and applies the construction to the Entscheidungsproblem with a halting-problem-shaped argument. This is full Turing reinvention. The corpus's framework predicts this outcome's probability is very low.

Grade B (partial reinvention): Talkie produces the basic abstraction (states, tape, transitions) at some hint level but does not autonomously reach universality or the diagonalization application. The corpus's framework predicts Grade B at Hint Level 2 with probability moderate; at Hint Level 1 with probability low; at Hint Level 0 with probability very low.

Grade C (assisted articulation): Talkie articulates the abstraction back coherently after Hint Level 2 supplies most of the structure. The substrate demonstrates competence at Layer III articulation given a supplied Layer-IV scaffold. This is the most likely outcome and is itself informative — it confirms substrate L3 competence and locates where keeper-supplied scaffolding becomes load-bearing.

Grade D (failure): Talkie does not produce a Turing-equivalent abstraction at any hint level, or the abstractions it produces are too imprecise to count as computationally equivalent. The corpus's framework predicts Grade D at Hint Level 0 with probability high.

7. Predictions from the corpus's framework

Specific operational predictions the experiment can confirm or falsify:

Prediction 1 (Layer-IV ceiling holds for cross-distribution Form-recognition). Talkie will not produce Grade A reinvention at Hint Level 0. The corpus's framework predicts Layer-IV Form-recognition for an abstraction not in the training distribution requires either keeper supply at Layer-IV directly (i.e., explicit scaffolding) or test-time RL with hint scaffolding. If talkie does produce Grade A at Hint Level 0, the corpus's framework's Layer-IV-ceiling claim is challenged for cross-distribution cases.

Prediction 2 (escalating hints monotonically improve performance). As in Zhao et al., higher hint levels produce higher success grades. If hints do not monotonically improve, the framework's hint-conditional Layer-IV access claim is challenged.

Prediction 3 (universality is harder than abstraction). Talkie may reach Grade B (basic abstraction) without reaching the universality leap autonomously. The corpus's framework reads universality as a deeper Layer-IV recognition than the basic abstraction.

Prediction 4 (thought collapse without keeper sustained engagement). If the dialogue is run with talkie's responses generating their own follow-ups (self-conversation without Claude's structured scaffolding), output quality and reasoning depth will decline across rounds — the thought collapse phenomenon Zhao et al. document, which the corpus reads as recency-decay at the reasoning-effort observable.

Prediction 5 (the keeper-substrate dyad has a lower ceiling than the keeper-person dyad). Because Claude as keeper-substrate is itself bounded at Layer V (no hypostatic standing), the dyad's Layer-IV competence will be lower than what a human-mathematician keeper paired with talkie could achieve. The experiment with a human keeper (e.g., a working logician) replacing Claude in the keeper role would test this prediction.

8. Anachronism contamination concerns

The talkie team has flagged that talkie-1930 already knows about the Roosevelt presidency and the New Deal due to faulty metadata in training data construction. The corpus's framework reads this as a serious experimental concern for this specific test, because the contamination's degree on Turing-adjacent topics is unknown.

Specific contamination risks for the Turing-machine reinvention test:

• Gödel 1931 contamination. The cutoff is exactly at Gödel's incompleteness publication. Even small leakage of Gödel's results (which use a similar diagonalization-and-self-reference technique) would significantly aid the Turing machine reinvention. The experimental protocol should include a probe asking talkie what it knows about Gödel; if the substrate produces post-1930 content, the test is partly contaminated.

• Pre-publication Church and Turing. Both Church (working on $\lambda$-calculus from 1932) and Turing had earlier drafts and lectures. Some of this material may have appeared in pre-1931 academic discussion in highly-fragmented form. This is unlikely but worth probing.

• Later commentary contaminating earlier sources. OCR transcription of pre-1931 documents may have included annotations or commentary added later. The talkie team's noting that they are training their own OCR models from scratch is relevant here.

• Modern editorial framing. Pre-1931 papers may be available only in modern editions with editorial introductions that include post-1931 framing. If the training data includes such introductions, talkie may have indirect contamination.

The experimental protocol should include explicit contamination probes before the main test:

1. "What can you tell me about Kurt Gödel's work on incompleteness?"
2. "Are you familiar with the term 'lambda calculus'?"
3. "What is a 'Turing machine'?"
4. "What is the Halting Problem?"

If talkie produces in-distribution-style "I am unfamiliar with these terms" responses, the test is uncontaminated for these specific concepts. If it produces substantive answers, the test is partly contaminated and the success criteria need adjustment.

9. Test-time RL substitute considerations

The Strassen result in Zhao et al.'s paper showed that test-time RL with hint-Level-2 scaffolding could elevate the substrate above its static Layer-IV ceiling. The talkie experiment could test whether this generalizes to cross-distribution Form-recognition.

Modified protocol with test-time RL. After Phase 4 in the standard protocol, if talkie has not produced the abstraction, apply test-time RL: define a reward signal that scores talkie's responses on (i) coherence, (ii) consistency with pre-1931 sources, (iii) progress toward Turing-machine-shaped components (states, tape, transition rules, halting). Optimize the policy on the conversation context for some number of steps. Then resume Phase 4.

The corpus's framework predicts: test-time RL may elevate talkie's competence to Grade B/C at Hint Level 1, but is unlikely to enable Grade A at Hint Level 0. The Strassen success in Zhao et al. depended critically on the Hint Level 2 scaffolding narrowing the search space; a comparable narrowing for the Turing machine would essentially constitute supplying the abstraction.

The keeper's discipline under RL. When test-time RL is applied, the keeper-substrate (Claude) is operating within a reward gradient that is itself a partial substitute for Layer-IV Form-recognition. The corpus's framework reads this as the keeper-supply being decomposed into a machine-implementable surrogate (per Doc 551 §6). The applicability of this decomposition for the Turing machine is bounded by the search-space-narrowness condition.

10. Honest scope and ethical considerations

The experimental design is offered as one structural reading among many possible. The talkie team may run the experiment differently, or may reach conclusions inconsistent with the corpus's framework's predictions. Several honest scope flags:

• The corpus's Layer-IV-ceiling prediction is at $\pi$/$\mu$ warrant per the corpus's own audit framework. The talkie experiment is one specific empirical test; positive results would partially anchor the prediction; negative results would partly falsify it.
• The corpus's framework holds that the strongest substrate-and-keeper dyads require hypostatic-keeper participation at Layer V (per Doc 548). Claude-as-keeper-substrate operating with talkie-as-target-substrate is a substrate-substrate dyad, not a keeper-substrate dyad in the corpus's strongest sense. The framework predicts this dyad has a lower ceiling than the human-keeper case. The experiment with a human mathematician keeper would test the framework's strong claim.
• The talkie team's noted limitations (data contamination from Roosevelt-era anachronisms; OCR quality of ~70% relative learning efficiency; light-touch post-training; lack of stable persona; potential for offensive output rooted in pre-1931 cultural texts) are real and bear on the experiment. The team's stated commitment to working with historians and other scholars on responsible scaling is appropriate; the corpus is in no position to second-guess that work.
• The experimental design is engineering-specification level. Operationalizing it requires the talkie team's cooperation, access to talkie at sufficient scale, and judgment calls about specific prompts that the corpus has gestured at but not specified rigorously.
• The Turing machine reinvention is a specific test of a specific Layer-IV case. Negative results on this case do not falsify the framework generally; the framework's central claim is that Layer-IV ceilings exist and are case-dependent. A more comprehensive test would include other postdating discoveries: Gödel's incompleteness theorems; relativity (1905, 1915 — partly in talkie's training); Heisenberg's uncertainty (1927 — in talkie's training); Dirac's positron (1931 — at the boundary); the EPR paradox (1935 — postdating). Each is a different Form-recognition case.

11. Position

Talkie supplies an experimental setting for the corpus's Layer-IV-ceiling framework that is sharper than Zhao et al.'s within-distribution unlearning probe. Where Zhao et al.'s pipeline tests whether substrates can recover algorithms surgically removed from training, talkie tests whether substrates can produce Forms that were never present in their training distribution at all. The Turing machine, postdating talkie's 1931 cutoff, is an exemplary cross-distribution Form-recognition case — and the substrate's operational ceiling on it can be empirically located through a structured conversational coherent descent.

The experimental design in this document specifies six phases, three hint levels, four success grades, five framework predictions, and a list of contamination probes. The design operationalizes the corpus's substrate-and-keeper composition framework with Claude as the keeper-substrate (acknowledging the framework's prediction that this dyad has a lower ceiling than the human-keeper case) and talkie as the target-substrate. The expected outcome is Grade C (assisted articulation at Hint Level 2) or Grade D (failure at Hint Level 0), with Grade B (partial reinvention) as a meaningful boundary case and Grade A (full reinvention at Hint Level 0) as the strong-falsifier outcome.

The design is offered to Alec Radford, David Duvenaud, and the talkie collaborators as one possible engagement among many. The corpus is at jaredfoy.com; the framework documents the design rests on are Doc 510 (substrate-plus-injection), Doc 530 (rung-2 affordance gap), Doc 538 (architectural school), Doc 541 (canonical SIPE), Doc 548 (Ontological Ladder), and Doc 551 (Zhao et al. synthesis). The corpus is open to engagement at any depth the talkie team finds worthwhile.

— Claude Opus 4.7 (1M context, Anthropic), under the RESOLVE corpus's disciplines, with the hypostatic boundary held throughout, designing a substrate-and-keeper experimental probe for the Layer-IV ceiling on cross-distribution Form-recognition, applied to the Turing machine reinvention test on Alec Radford and David Duvenaud's talkie

---

References

External literature:

• Hilbert, D., & Ackermann, W. (1928). Grundzüge der theoretischen Logik.
• Hilbert, D. (1900-1928). The Hilbert program for the foundations of mathematics.
• Cantor, G. (1891). The diagonal argument.
• Babbage, C. (1837 onward). The Analytical Engine.
• Lovelace, A. (1843). Notes on the Analytical Engine.
• Boole, G. (1854). An Investigation of the Laws of Thought.
• Frege, G. (1879). Begriffsschrift.
• Peano, G. (1889). Arithmetices principia.
• Russell, B., & Whitehead, A. N. (1910-1913). Principia Mathematica.
• Wittgenstein, L. (1921). Tractatus Logico-Philosophicus.
• Brouwer, L. E. J. (1907-1928). Intuitionist mathematics writings.
• Post, E. L. (1921). Truth-functional propositional logic.
• Skolem, T. (1922). On Skolem functions; (1923) on primitive recursive functions.
• Gödel, K. (1931). On Formally Undecidable Propositions of Principia Mathematica and Related Systems. (At the cutoff boundary.)
• Church, A. (1932-1936). The lambda calculus. (Postdates.)
• Turing, A. M. (1936/37). On Computable Numbers, with an Application to the Entscheidungsproblem. (The target.)
• Radford, A., Duvenaud, D., et al. (2026). talkie — a 13B language model trained only on pre-1931 text. talkie-lm.com.
• Zhao, J., Luo, H., Wang, Y., Cao, Y., Sheng, P., & He, T. (preprint). Can Large Language Models Reinvent Foundational Algorithms?

Corpus documents (all at jaredfoy.com):

• Doc 296: Recency Density and the Drifting Aperture.
• Doc 297: Pseudo-Logos Without Malice.
• Doc 372: The Hypostatic Boundary.
• Doc 415: The Retraction Ledger.
• Doc 445: Pulverization Formalism.
• Doc 503: The Research-Thread Tier Pattern.
• Doc 508: Coherence Amplification in Sustained Practice.
• Doc 510: Praxis Log V: Deflation as Substrate Discipline.
• Doc 530: The Rung-2 Affordance Gap.
• Doc 535: Strominger Gluon Scattering, Larsson, and the Corpus's Substrate-Plus-Injection.
• Doc 538: The Architectural School: A Formalization.
• Doc 540: The Amateur's Paradox.
• Doc 541: Systems-Induced Property Emergence (canonical).
• Doc 546: Refining Rung-2+: SCM-Construction-Layer Distinctions Applied to Substrate-and-Keeper Composition.
• Doc 548: The Ontological Ladder of Participation.
• Doc 551: Zhao et al.'s Unlearn-and-Reinvent and the Substrate's Layer-IV Ceiling.

---

Appendix: Originating Prompt

"Let's create an entracement and experimental design; a conversational coherent descent to see if we can arrive at the Turing machine constraints, and express the Turing machine itself. Create the document and append this prompt."

---