The homological form of the Church–Turing thesis

Let $L$ be a physically realizable computation and let $h(L)$ denote its homological complexity. Homological Church–Turing thesis. Every physically realizable computation has finite homological complexity,

$$h(L)<\infty,$$

and the laws of physics determine the maximum achievable homological complexity. This proposes a physical strengthening of the Church–Turing thesis by placing a homological bound on realizable computations. The source presents it as a research-level conjecture and provides no formal physical model or proof of the asserted bound.