Actual Demand of a Computational Substrate: A Reconciled Demand‑Side and Allocation Framework for Physical Computing Platforms

In the paper's words

Debates about novel computational substrates—reservoir systems, post‑qubit quantum architectures, thermodynamically bounded devices—are usually conducted from the supply side: what can a given physical system compute? Far less attention is paid to the complementary question of what demand is actually placed on a substrate, at what rate, with what variance, and against what physical cost floor. This paper reconciles two formalizations of that demand side.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Time to saturation satisfies $$ C = D_0 (1+g)^{t_{\text{sat}}} \;\Longrightarrow\; t_{\text{sat}} = \frac{\ln(C/D_0)}{\ln(1+g)}. $$ Compute $$ \ln(C/D_0)=\ln(1/0.44)=\ln(2.272727)=0.820980, $$ $$ \ln(1+g)=\ln(1.5)=0.405465. $$ Hence $$ t_{\text{sat}} = \frac{0.820980}{0.405465}=2.0249\ \text{years}\approx 2.0\ \text{years}. $$ If $g=0.1$ (10 %/year), $$ \ln(1.1)=0.095310,\qquad t_{\text{sat}} = \frac{0.820980}{0.095310}=8.613\ \text{years}. $$ Sensitivity factor $$ \frac{8.613}{2.025}\approx 4.25. $$ The projection rests entirely on the assumed growth rate; the factor quantifies how sensitive the saturation time is to that assumption.

   from 4.6 Projection: time‑to‑saturation

2. When demand is right‑censored by capacity, the measured mean $\bar{\hat d}$ underestimates the true mean $\bar d$ by the shortfall ratio (38.2 % in the worked case).

   from 6. Discussion

3. The central quantitative claim is that, under right‑censoring, the naïve measured mean demand underestimates the true mean by exactly the shortfall ratio $S/\bar d$ (38.2 % in the illustrative two‑state model).

   from 6. Discussion

4. Assume demand grows at a compound annual rate $g=0.5$ (50 %/year) from an initial mean $D_0=0.44$ against fixed capacity $C=1$.

   from 4.6 Projection: time‑to‑saturation

5. Both are coupled to a thermodynamic cost floor built from the Landauer bound and an error‑correction overhead range of $10^{2}$–$10^{3}$ physical operations per logical operation reported in the physics‑of‑computation literature.

   from Abstract

6. With full arithmetic we compute: a Landauer floor of $2.871 \times 10^{-21}$ J per irreversible bit operation at $T = 300$ K; a per‑logical‑operation floor of $2.871 \times 10^{-19}$ to $2.871 \times 10^{-18}$ J; an illustrative match score $M = 0.800$ with waste $W \approx 0.0732$; a two‑state provisioning model with waste = shortfall = 0.168 at mean provisioning; a censoring bias of $38.2\%$ in naïvely measured demand; a projected workload energy floor of $0.287$–$2.871$ J for $10^{18}$ logical operations; and a time‑to‑saturation of roughly $2.0$ years under a $50\%$ annual demand growth assumption, with a sensitivity factor of $\approx 4.25$.

   from Abstract

How it is done

1. Both are coupled to a thermodynamic cost floor built from the Landauer bound and an error‑correction overhead range of $10^{2}$–$10^{3}$ physical operations per logical operation reported in the physics‑of‑computation literature.

   from Abstract

2. Both are coupled to a thermodynamic cost floor built from the Landauer bound and an error‑correction overhead range of $10^{2}$–$10^{3}$ physical operations per logical operation, as reported in the physics‑of‑computation literature [12].

   from 1. Introduction

3. We use the Markov‑modulated structure of [7] as the skeleton of our illustrative demand model in Section 3.

   from 2. Background and Related Work

4. Following the Markov‑modulated structure of [7], we model substrate demand as a process $d(t)$ modulated by a hidden world‑state $s(t)\in\{h,l\}$ with stationary occupancy probabilities $p_h = p$ and $p_l = 1-p$.

   from 3.2 Allocation model

What would falsify it

1. Steps (i)–(ii) are judgemental and are where the framework is falsifiable; steps (iii)–(iv) are pure arithmetic, shown in full in Section 4.

   from 3.4 Procedure

2. What would falsify the main claim.

   from 6. Discussion

3. Empirical observation of a capacity‑constrained substrate in which the measured mean $\bar{\hat d}$ equals the true mean $\bar d$ (i.e., $\bar d-\bar{\hat d}=0$) despite documented refusals would falsify the censoring‑bias identity and invalidate the derived bias correction.

   from 6. Discussion

Where the claim stops

1. The quantitative results rest on the following explicit assumptions, each of which bounds the validity of the derived numbers: Illustrative capability vectors – The demand vector $d$ and supply vector $s$ used in the match‑score example are judgement‑based assessments, not empirical measurements.

   from 6. Discussion

2. Optimistic Landauer floor – The Landauer bound $E_{\min}=2.871\times10^{-21}$ J assumes every physical operation is an irreversible bit erasure performed at the thermodynamic limit.

   from 6. Discussion

3. Growth‑rate assumption for saturation – The time‑to‑saturation projection uses a compound annual demand growth $g=0.5$.

   from 6. Discussion

Where to read

1. Abstract266 words · 1 min
2. 1. Introduction614 words · 3 min
3. 2. Background and Related Work771 words · 3 min
4. 3. Methods399 words · 2 min
5. 4. Analysis589 words · 3 min
6. 5. Results158 words · 1 min
7. 6. Discussion667 words · 3 min
8. 8. Practical Implications and Engineering Pathways682 words · 3 min
9. 9. Conclusion216 words · 1 min
10. Provenance and AI Involvement225 words · 1 min