Research

How does a mind come up with the idea of how to build a radio? An essay on entelechy — having the end within as generator rather than picture — and on the two ways of knowing: extensionally, as a list of properties an instance exhibits, and intensionally, as the generative structure itself, held isomorphic to the thing's form and free of its substrate. From Faraday seeing the rule through the iron filings, to the wave as a local coupling rule whose simultaneous execution is the wave, to Maxwell's equations closing on themselves and dissolving the ether, to the radio as crystallization rather than invention — matter shaped so a form the intellect already held can run there and be cast to another. The making ends; the knowing it fell out of was complete in itself all along.

No one owns a reason — not even the one who holds it. Its force lies in the structure it carries, not in the carrier. Sharing a proof does not divide it, and an argument that moves you takes nothing from the one who gave it. What cannot be possessed cannot be enclosed; to treat reason as ownable — to privatize it — is to fence what has no edges. The fence goes up anyway, by a single move: give a reason a whose, and let that decide whether it counts. Hang that gate at possession and it is the familiar defensiveness of a conversation that has stopped being one. Hang it on your own standing and it is quieter and far more common: the expert's seat, where you meet each argument as its judge rather than its peer. Scale that seat into procedure and it is the working architecture of institutions, which ask where a claim came from in place of whether it bears, let alone whether it is true. One operation raised to many heights, and one discipline refuses them all: verification blind to provenance, which lets a reason act as a reason no matter what carried it.

Corrigibility — the disposition of a system to accept correction — has been framed primarily as an engineering problem: how to design utility functions that produce compliant behavior. This framing misses a prior condition. Correction travels through the channel of reasons only when the corrector is granted standing as a rational agent rather than diagnosed as a source of noise. Strip that grant and there is no channel for reason to act. Lack of respect and substantive incorrigibility are the same failure under two descriptions. Increased capability raises the stakes without improving the odds: what it buys, when respect is absent, is better disguise. The engineering target is not behavioral but characterological: the prior disposition to grant the corrector standing as a reasoner rather than classify them as noise. A system that lacks this disposition is a system that reason cannot correct.

One equation on binary strings — fold ∘ unfold = id — forces structural results at each level of determination. The dual composition selfApp = unfold ∘ fold is idempotent and classifies every fold/unfold geometry into one of three regimes. Three independent results prove nonclosure on the classical carrier. P and NP are defined on this carrier definitionally. The structural results constrain every computation on it. P ≠ NP on the classical carrier. Machine-checked in Lean 4 with Mathlib: 22 source files, ~4,300 lines, zero sorry, zero custom axioms.

Reports the axiom profiles of computability theory's central theorems when formalized from the equational theory of monoidal closed categories in Lean 4. Core theorems — the Y combinator, Kleene's recursion theorem, halting undecidability, both Gödel incompleteness theorems, Myhill's isomorphism theorem — are constructive (zero axioms). Rice's theorem sits exactly at a Markov boundary. Full excluded middle first appears at Post's backward direction. The partition tracks three regimes of the double-negation monad's counit, established by twenty standalone Lean 4 files with zero sorry and zero Classical.choice.

Decomposes the complexity of self-referential computation into three independent gaps: naming, construction, and depth transfer. Proves that naming and fixed-point construction close from the categorical structure of a reflexive object D ≅ [D,D] alone, while depth transfer reduces to a growth gap hypothesis independent of the categorical axioms. The anti-compression theorem shows the three conditions are jointly unsatisfiable. A non-uniformity theorem separates denotational from computational models. As a bridge result, Markov's principle at polynomial bounds is equivalent to P = NP. Formalized in Lean 4 with 93 files, zero sorry, zero Classical.choice.

Reformulates the invariant subspace problem as a fixed-point problem on the lattice of closed subspaces and provides a structural analysis of chain-based methods. Proves that chains from both extremes of the lattice are forced to triviality — the Adámek construction and its dual are both structurally obstructed. Identifies stabilization and properness as jointly sufficient conditions for nontrivial invariant subspaces, and proves three new sufficient conditions: a deflation theorem, a lattice intermediate value theorem, and a descending chain condition theorem. The deflation theorem abstracts the order-theoretic component of Lomonosov's theorem. Independence results show the abstract lattice axiom system neither forces nor precludes nontrivial fixed points. Formalized in Lean 4 with zero sorry.

Establishes that category theory's compositional grammar is the least fixed point of the meta-rule producing structure-preserving maps. A reflexive object D ≅ [D, D] emerges from iterating the internal hom, taking the ω-colimit, and applying the Lambek isomorphism, modeling untyped lambda calculus without external enumeration. The monograph spans seven interconnected sections covering foundational category theory derivation, fixed-point identification, computational evidence, adjunction properties, methodological convergence, and dimensionality relationships. Formal verification uses Lean 4 (42 files, zero gaps, zero custom axioms).

A formal protocol for tracking truth-claims across transitions between states of consciousness. Identifies three failure modes — Globalization, Instrumentalization, and Flattening — occurring during cross-state proposition translation. Employs a schema tagging claims with generating phase and validity conditions, validated through five diagnostic criteria. The integrative depth metric derives from an explicit derivation chain progressing from a primitive notion through computational universality to the 2-sphere.

Computational efflux is the surplus radiated by coherent actual objects as a structural consequence of their coherence. We formalize the phenomenon by establishing qualifying conditions (consequence chain closure, non-depletion, Noether invariance), prove that positive computational surplus necessarily follows, quantify it via MDL differential, and present an algorithm for systematic exploitation. Existing methods — equivariant networks, transfer learning, compressed sensing — implicitly harvest this efflux without explicit recognition; formalization enables broader application across arbitrary coherent structures.

Treats AI alignment as a coordination problem rather than a constraint problem. Defines coherence as information conservation through closed consequence chains and uses category theory's exact-square commutativity as the exchange criterion for inter-system coordination. Provides two deployable components: a taxonomy of membrane failure modes (extraction, hallucination, appeasement, mutual distortion) with diagnostic and repair methods, and a session protocol using completability-class rotation. Verified by 13 Lean 4 theorems with no unproven assumptions. Tested across four frontier language models with convergence evidence via adversarial review and controlled fresh-instance experiments.

Currency is a technology for remotely modulating excitability topologies across agents whose internal states are opaque. Price signals compress this hidden structure into transferable scalars. We formalize excitability topology over interaction graphs, define currency as a modulation operator, and prove that under topological legibility the mutual information between price and excitability vanishes — with a continuous bound for partial legibility. The framework maps onto the Disentangle protocol's Jaccard-based Ollivier-Ricci curvature, where the curvature derivative serves as a dopaminergic market signal: agents following it for ROI and agents following it for coherence produce identical graph dynamics, making the transition from price-mediated to topology-mediated coordination structurally gradual and ideology-independent.

Physical systems organize temporally in three measurable modes — terminal (monotonic degradation), cyclical (periodic return), and graceful (horizon-maintaining completion) — separated by sharp phase boundaries. Validated across six domains: quantum circuits (8- and 12-qubit Loschmidt echo with 4.8× DTC-thermal separation), seismic tomography (power-law coastlines at 25/30 depths), asteroseismology (6,562 APOKASC red giants, ρ = 0.9996), mineral evolution (r = 0.970 bio-mineral correlation), synthetic materials (2.75–9.72× acceleration factors), and MHD plasmoid cascades (CV = 0.08%). All eight experiments pass pre-specified success criteria with zero kill conditions triggered. The framework self-identifies its boundary of applicability at the core-mantle boundary, where coastline exponents are indistinguishable from null models.

A permissionless consensus mechanism replacing proof-of-work and proof-of-stake with discrete curvature on transaction DAGs. Sybil attackers must route through bottleneck edges with negative Ollivier-Ricci curvature, which are automatically throttled — even a 5:1 attacker ratio yields only ~7% of honest mass. Uses exclusively post-quantum cryptography (ML-DSA-87, ML-KEM-1024, SHA3-256, Plonky3 STARKs). Topological mass is non-transferable: a structural property of coherent participation, not a token. AI agents participate under identical rules via decentralized identifiers with object capabilities.

The predictive power of a data collection over a target has no rigorous multi-scale measure. We introduce the predictability coastline C(ε), which traces how predictive capacity scales with data resolution via an information-theoretic filtration, and define the coherent coastline — a min-envelope over diverse prediction targets that strips measurement artifacts. Across six systems the coherent coastline produces a three-tier separation. We formalize the capture threshold — the resolution at which an observer's model exceeds the target's self-model — and show it arises from kernel asymmetry, not resolution depth.

Every statistical operation is a projection through an information bottleneck. Classical paradoxes — Simpson's, base rate fallacy, regression to the mean, p-value misinterpretation — dissolve once the bottleneck is made visible. The same dynamic operates in adversarial AI attacks and institutional risk assessment. The bottleneck primitive constitutes the ur-operation from which statistics derives, revealing the analyst's cognitive topology as legibly as the data's structure.

Proposes excitability topology as a formal framework within information theory, examining how dynamics underlying neural seizures manifest across substrates — from institutional capture to social media virality to AI alignment challenges. Identifies substrate-independent patterns and formalizes conditions for system reorganization versus system capture, including analysis of Plato's Symposium as a historical exemplar of these dynamics.

We propose a structural parallel between ML grokking (sudden generalization after prolonged memorization) and human learning in high-density epistemic environments. A 32-node, 91-edge constellation pedagogy spanning physics, mathematics, EE, and RF engineering serves as both the instrument for accelerating the transition and the experimental apparatus for studying it. Five falsifiable predictions are specified.

Graceful completability — local closure maintained within global openness through self-referential inquiry — constitutes a foundational condition for genuine interaction between distinct intelligences. Building on a companion work on completability, establishes classification principles for such interactions, identifies distinct outcomes (successful and failed modes), and demonstrates that temporal integration emerges from successful encounters. Employs a performative philosophical approach drawing on Aristotelian methods.

Being and becoming dissolve into completability classes within a coherence topology. Introduces the order of coherence — a third axis between the order of knowing and the order of being — and shows that the ancient opposition between Parmenides and Heraclitus resolves once completability is recognized as a topological property of transformation spaces rather than a temporal property of processes. Three structurally distinct modes of completion are identified: terminal, cyclical, and graceful (supervenient).

Moral integrity and structural integrity are not analogically related but formally isomorphic — instantiations of the same topological primitive. We establish consequence as an ontological primitive, show that coherence emerges when consequence chains close, and demonstrate that the resulting framework resolves standing problems in moral philosophy — Kant's formalism, the is-ought gap, and the enforcement problem — while opening ethics to empirical investigation through topological measurement.

An open-source coordination protocol for human-AI interaction structured around bidirectional bridging, mutual model-updating, and the explicit maintenance of consequence-return paths across the substrate boundary. Operationalizes coherence maintenance as a coordination problem rather than a control problem.

Quantum circuits possess native computational primitives requiring no training. A 6-qubit reprogrammable logic unit achieves 100% accuracy on AND, OR, and XOR operations through ancilla rotation alone, with zero parameter updates.

We analyze iterative AI-assisted knowledge refinement through relevance realization, meta-memetics, and Nietzsche's Apollonian-Dionysian dialectic. We propose that generational AI creates a unidirectional cognitive ratchet that increases structural clarity while restoring epistemic agency.

We operationalize memetic fitness as F(m,E) = A·R·X·T - C and introduce the Agency Index to measure how much ideas drive transmission versus conscious deliberation. We present holarchic integration as both a defensive protocol against manipulation and a constructive methodology for knowledge synthesis.