User blog comment:Plain'N'Simple/A question for proof-theory experts/@comment-39259101-20191029180948

<f is computable and can be proven to be a total function in ACA0 in less then 10n symbols

do you mean a turing machine proven to halt in less than 10^n shifts using ACA0