3 problems

Let $g$ be a specified graph and $G$ a larger graph. Represent them by rigid simplexes $s$ and $S$, respectively, and dynamically dock these simplexes during the proposed physical…

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

A physical phenomenon or effect is modeled as an object whose behavior can be simulated to arbitrary precision. Physical Church–Turing hypothesis. Every physical phenomenon or effe…