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…