A Note on Universal Measures for Weak Implicit Computational Complexity

Abstract. This note is a case study for finding universal measures for weak implicit computational complexity. We will instantiate “univer-sal measures ” by “dynamic ordinals”, and “weak implicit computational complexity ” by “bounded arithmetic”. Concretely, we will describe the connection between dynamic ordinals and witness oracle Turing ma-chines for bounded arithmetic theories