External Links

    Journal: Computability

    Volume 14, Issue 3-4

    139 -- 156Pavel Alaev, Victor L. Selivanov. Complexity issues for the iterated h-preorders
    157 -- 171Sam Sanders. On the computational properties of the Baire category theorem
    172 -- 177Daniel S. Mourad. There is no composition in the [strong] computable reducibility degrees
    178 -- 197Olivier Bournez, Riccardo Gozzi. Set descriptive complexity of solvable functions

    Volume 14, Issue 2

    73 -- 94Uri Andrews, Steffen Lempp, Alberto Marcone, Joseph S. Miller, Manlio Valenti. A jump operator on the Weihrauch degrees
    95 -- 110Nicanor Carrasco-Vargas. Infinite Eulerian paths are computable on graphs with vertices of infinite degree
    111 -- 127Irakli O. Chitaia, Valentino Delle Rose, Andrea Sorbi. On the transversals of a ceer
    128 -- 135Caleb Davis, Jeffry L. Hirst, Silva Keohulian, Brody Miller, Jessica Ross. Reverse mathematics of a color basis theorem

    Volume 14, Issue 1

    3 -- 16Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele. On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars
    17 -- 29Patrick Uftring. Weihrauch degrees without roots
    30 -- 37Makoto Fujiwara, Takako Nemoto. Choice principles characterizing the difference between König's lemma and weak König's lemma in constructive reverse mathematics
    38 -- 62Masahiro Kumabe, Kenshi Miyabe, Toshio Suzuki. Solovay reducibility via Lipschitz functions and signed-digit representation
    63 -- 69Alexa McLeod, Reed Solomon. Computing strategies for multiple cops on infinite graphs
    runs on