Go to the corresponding LIPIcs Volume Portal 
Bazhenov, Nikolay ; Kalociński, Dariusz ; Wrocławski, Michał
pdfformat: 

@InProceedings{bazhenov_et_al:LIPIcs.STACS.2022.8, author = {Bazhenov, Nikolay and Kaloci\'{n}ski, Dariusz and Wroc{\l}awski, Micha{\l}}, title = {{Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {8:18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772228}, ISSN = {18688969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15818}, URN = {urn:nbn:de:0030drops158185}, doi = {10.4230/LIPIcs.STACS.2022.8}, annote = {Keywords: Computable Structure Theory, Degree Spectra, \omegaType Order, c.e. Degrees, d.c.e. Degrees, \Delta₂ Degrees, Learnability} }
Keywords:  Computable Structure Theory, Degree Spectra, ωType Order, c.e. Degrees, d.c.e. Degrees, Δ₂ Degrees, Learnability  
Collection:  39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)  
Issue Date:  2022  
Date of publication:  09.03.2022 