3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.ST2026
A First-Order Entropy Law for Canonical T-Complexity of Finite-Alphabet i.i.d. Sources
Thomas Schürmann
Let be an exact length- block from a strictly positive i.i.d. source on a fixed finite alphabet. We prove that the canonical T-complexity satisfies \[ \f…
cs.IT2026
Non-Simple T-Prescriptions Yield T-Complexity Gains Infinitely Often
Thomas Schürmann
Titchener et al. (2005) asked whether non-simple T-prescriptions can achieve larger T-complexity than simple T-prescriptions for infinitely many finite values of the maximum codewo…
quant-ph2022★ 3 cited
On the experimental verification of the uncertainty principle of position and momentum
Thomas Schürmann, Ingo Hoffmann, Winfrid Görlich
Historically, Kennard was the first to choose the standard deviation as a quantitative measure of uncertainty, and neither he nor Heisenberg explicitly explained why this choice sh…