Mark Burgin. “Inductively Computable Hierarchies and Inductive Algorithmic Complexity”. Global Journal of Computer Science and Technology, vol. 16, no. H1, Jan. 2016, pp. 35-45, https://computerresearch.org/index.php/computer/article/view/1357.