The Switching Economics of Hamiltonian Re-Entry Computation: A Cost-Model Comparison with Stored-Program Architectures

In the paper's words

Stored-program (von Neumann) architectures pay a per-operation switching cost for instruction fetch, decode, and memory traffic, while a proposed Hamiltonian-computation paradigm identifies computation with continuous dynamical trajectories that re-enter a designated operating region of phase space. The specific gap addressed here is that the re-entry proposal has no explicit, parameterized cost accounting against the switching economics of the stored-program regime, so its economic case cannot be evaluated or falsified. This paper adopts the minimal two-model cost formalism of the prior re-entry analysis — an explicit-controller model with per-operation switching cost c_sw and an autonomous re-entry model with per-operation cost c_re — and extends it with a cache-aware break-even derivation and a cross-convention figure of merit.

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

Numbers it reports

1. Under the stated illustrative assumptions ($k_{\mathrm{acc}} = 4$ memory accesses per operation, $t_{\mathrm{mem}} = 16$ time units per access, $t_{\mathrm{alu}} = 1$, $t_{\mathrm{dyn}} = 4$, $t_{\mathrm{re}} = 1$), the switching cost per operation is $c_{\mathrm{sw}} = 65$ time units against a re-entry cost $c_{\mathrm{re}} = 5$, a ratio of $13.0$; the switching overhead fraction is $f_{\mathrm{sw}} = 64/65 = 0.984615\ldots$ versus $f_{\mathrm{re}} = 0.2$.

   from Abstract

2. That analysis derived a per-operation switching cost of $65$ time units against a re-entry cost of $5$ under explicitly memory-bound assumptions, a ratio of $13.0$, and identified the parameters on which the case turns.

   from 1. Introduction

3. The contributions are: A restatement and verification, with fully shown arithmetic, of the two-model cost formalism and its headline results ($c_{\mathrm{sw}} = 65$, $c_{\mathrm{re}} = 5$, ratio $13.0$, break-even $t_{\mathrm{mem}}^{*} = 1$, robustness threshold $t_{\mathrm{re}}^{*} = 61$), drawn from the prior analysis and re-derived in Section 4.

   from 1. Introduction

4. A cross-convention figure of merit $\sqrt{13.0 \times 3.125} = 6.3738\ldots$ combining the time-unit and cost-unit parameterizations (Section 4, Derivation 9).

   from 1. Introduction

5. Input scheduling based on Birkhoff-von-Neumann (BvN) decomposition achieves high throughput and low complexity, but the performance of the BvN switch becomes less predictable when the input traffic is bursty; the deflection-compensated BvN (D-BvN) switch architecture was proposed to enhance the quasi-static scheduling based on BvN decomposition, and its simulation compares average end-to-end delay against an ideal-deflection analytical lower bound, with the required critical VOQ size for a loss rate of $P_l = 10^{-5}$ entering the comparison and the average delay increasing linearly with burstiness [1].

   from 2. Background and Related Work

6. Von Neumann associated an entropy quantity to a statistical operator in 1927, by a gedanken experiment on the ground of phenomenological thermodynamics, and the discussion was extended in his 1932 book Mathematische Grundlagen der Quantenmechanik ; the historical reconstruction stresses the role of superselection sectors [3].

   from 2. Background and Related Work

How it is done

1. That analysis derived a per-operation switching cost of $65$ time units against a re-entry cost of $5$ under explicitly memory-bound assumptions, a ratio of $13.0$, and identified the parameters on which the case turns.

   from 1. Introduction

2. Input scheduling based on Birkhoff-von-Neumann (BvN) decomposition achieves high throughput and low complexity, but the performance of the BvN switch becomes less predictable when the input traffic is bursty; the deflection-compensated BvN (D-BvN) switch architecture was proposed to enhance the quasi-static scheduling based on BvN decomposition, and its simulation compares average end-to-end delay against an ideal-deflection analytical lower bound, with the required critical VOQ size for a loss rate of $P_l = 10^{-5}$ entering the comparison and the average delay increasing linearly with burstiness [1].

   from 2. Background and Related Work

3. To combine them into one scale-free indicator we use the geometric mean $\sqrt{13.0 \times 3.125}$, which is insensitive to which convention is larger and penalizes disagreement between conventions.

   from 3.3 New methodological elements introduced here

4. Every number in this section is derived from stated inputs.

   from 4. Analysis

What would falsify it

1. The specific gap addressed here is that the re-entry proposal has no explicit, parameterized cost accounting against the switching economics of the stored-program regime, so its economic case cannot be evaluated or falsified.

   from Abstract

2. An explicit falsification criterion and limitations list for the claimed advantage (Section 6).

   from 1. Introduction

3. Rigidity of observable subdynamics.

   from 2. Background and Related Work

Where the claim stops

1. What the comparison does and does not show.

   from 6. Discussion

2. The ratio $13.0$ is a property of the assumed parameters, not of the architectures; its role is to isolate the parameters — $t_{\mathrm{mem}}^{\mathrm{eff}}$, $t_{\mathrm{re}}$, and in the alternative convention $c_p$, $L$, and $n$ — on which the re-entry proposal's economic case turns.

   from 6. Discussion

3. The cache constraint is the first-order limitation.

   from 6. Discussion

Where to read

1. Abstract248 words · 1 min
2. 1. Introduction696 words · 3 min
3. 2. Background and Related Work1,600 words · 7 min
4. 3. Methods524 words · 2 min
5. 4. Analysis1,296 words · 6 min
6. 5. Results373 words · 2 min
7. 6. Discussion1,534 words · 7 min
8. 7. Practical Implications and Engineering Pathways817 words · 4 min
9. 8. Conclusion274 words · 1 min
10. Provenance and AI Involvement225 words · 1 min