PRPieter van Rooyen

Pieter van Rooyen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Latest Publications

  • Open Access

    Recoverable Self-Coding: A Single-Server Queueing Model of Commitment Recoverability

    by Pieter van Rooyen

    Shannon’s channel-coding theorem permits arbitrarily reliable communication at rates below the channel capacity and rules it out above it. This paper asks the corresponding question of a system that acts irreversibly on what it infers: can its commitments still be undone? This matters because a decision that is not reviewed in time becomes permanent, right or wrong. The framework is called Recoverable Self-Coding (RSC). Candidate commitments arrive at rate R self , and one certifier checks them at rate C self ; both rates can be estimated from event counts. The framework proposes that irreversible action is admissible only while the margin M = C self − R self is positive. The certifier is modelled as a single-server queue of capacity ratio CR = R self / C self , whose uncertified backlog N is the mean number of commitments awaiting certification. An exact identity for N holds at every CR below one; for fixed shapes with positive variability, c a 2 + c s 2 > 0 , it grows as ( 1 − CR ) − 1 near CR = 1 , and three exact solutions agree with the simulation. Under the outcome model, the recoverable fraction of commitments falls from 0.75 to 0.04 as CR rises from 0.5 to 0.94 while accuracy stays at or above its floor p lo , a separation that is derived rather than measured. Two limits follow: counting uncertainty sets the observation time needed to estimate the margin—centuries for the review board of the opening example—and the collapse belongs to pipelines that keep expired work. One application is offered as an untested hypothesis: artificial intelligence (AI) may raise the rate of proposed decisions faster than review capacity.

  • Open Access

    Entropy, Annealing, and the Continuity of Agency in Human–AI Systems

    by Pieter van Rooyen

    Adaptive systems that couple inference to irreversible commitment are governed by a rate-capacity law analogous to Shannon's: agency persists only while the induced informational flux Rself remains below the integrative capacity Cself. We define Recoverable Self-Coding (RSC), a structural framework in which the self - human, organizational, or artificial - is a self-decoder whose feasibility is tracked by a small set of measurable parameters: the capacity ratio CR = Rself/Cself, the margin M = Cself - Rself, the accessible-option entropy Hself, an exploration temperature T, and a finite integration horizon. Sustained CR > 1 makes state evolution non-invertible: options are eliminated faster than they can be reconstituted, and recovery cannot be restored by effort, intelligence, or optimization. We show that the parameters are directly estimable from open longitudinal event streams, verifying the construct on four open cohorts - synthetic health records (~1,900 units), the MIMIC-IV and eICU demonstration cohorts, and ~40,000 ICU stays from the PhysioNet/CinC 2019 sepsis challenge - where critically ill patients concentrate at the feasibility boundary CR ≈ 1 and outcome-labelled populations (sepsis; death in unit) sit measurably deeper into infeasibility without any fitted model. Applications are developed for healthcare capacity monitoring; for human agency under rate shocks - episodes, from a serious diagnosis to AI adoption, that abruptly multiply the induced flux against slow-adapting personal capacity; and for operational systems whose certification backlogs are directly observable. Annealing - regulated exploration followed by feasibility-paced consolidation - emerges as the admissible dynamics for staying recoverable under acceleration.