Mark Burgin. (2016). Inductively Computable Hierarchies and Inductive Algorithmic Complexity. Global Journal of Computer Science and Technology, 16(H1), 35–45. Retrieved from https://computerresearch.org/index.php/computer/article/view/1357