Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"bounded Turing reduction"”.

  1. Computability Theory and Some Applications

    … regarding the degree-theoretic notion of the bounded Turing hierarchy. In Chapter 2 (joint with Csima, Harrison-Trainor, Mahmoud), the set of degrees that are computably enumerable in and above $\mathbf{0}^{(\alpha)}$ are shown to be degrees of categoricity of a structure, where $\alpha$ is a …

    waterloo Repository record for Computability Theory and Some Applications (opens in a new tab)