Free cookie consent management tool by TermsFeed Generator

Series: The Portable Mind: Five Properties of Thinking

Thinking architecture is portable across a human brain and a transformer. Correctness is not.
Five formal properties of thinking, each pinned to a real theorem: Ashby's Law for Noticing and Simulation, a sufficiency identity for Abstraction, an asymmetric-updating result for Rationality, a resource-bounded Loeb's theorem for Awareness, and cost-aware optimal stopping for Optimization. Every theorem is tested against a matching human finding and a current AI-agent finding. One real case opens the series and closes it, rerun through everything the four posts build in between, and Post 4 prices the portability gap itself: a structural cost, computable in kind, never a number any single deployment can just adopt. A fifth post asks what the five external loops actually have in common, and derives the general criterion underneath all of them.

5 posts in this series

  1. 1. Noticing and the Cost of Not Knowing Enough

    Ask a system to price a job before it has looked at the job, and watch it guess wrong with total confidence. That is not a personality flaw. It is arithmetic: nobody can spend variety they have not noticed yet, whether the nobody is a person or a model. This post opens a series about five ways thinking fails, for reasons that were always going to be reasons, not accidents anyone can tune away. Opening The Portable Mind.

    29 August 2026

  2. 2. Sufficient Abstraction and the Cost of Asking the Wrong Question Twice

    A summary that was perfect yesterday can be perfectly wrong today, and nothing about the summary itself has to change for that to happen. The world moved. The old answer just kept insisting it was still the right one. This post is about that particular stubbornness, and its quieter cousin: believing the evidence that agrees with you a little more than the evidence that doesn't. Post 2 of The Portable Mind.

    30 August 2026

  3. 3. Awareness and the Proof a Reasoner Cannot Write About Itself

    Confidence is not evidence. A system can be completely wrong and completely sure of it at the same moment, because the part that feels sure and the part that would actually know better were never talking to each other. This post asks a reasoner to grade its own homework, and proves, carefully and a little reluctantly, that a certain honest kind of reasoner logically cannot. Post 3 of The Portable Mind.

    04 September 2026

  4. 4. Optimization and the Ceiling No Retry Can Raise

    Ask one agent whether to keep funding a failing project and it usually says no. Put a small crowd of them in a room, agreeing with each other in a circle, and the answer flips to yes almost every time. This post is about knowing when to stop, why stopping on purpose is not the same as giving up, and why a crowd can talk itself out of the one instinct any of its members had alone. It also closes the series' running case, and puts an honest price on what all this trust-but-verify machinery actually costs. Post 4 of The Portable Mind.

    05 September 2026

  5. 5. The Shared Ancestor Problem

    Two series on this blog solved the same puzzle. Neither knew the other existed. Both landed on one quiet rule: a check is only as honest as the mistake it cannot inherit. This post finally says that rule out loud. It comes in two flavors, one that bends under pressure and one that never does, plus a third case nobody ordered: a process with nothing wrong with it that still needs a babysitter, because of where its inputs came from. Post 5 of The Portable Mind.

    06 September 2026

← Back to all posts