Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order

Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski. Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. In Petra Berenbrink, Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Volume 219 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.