Degree Spectra

Degree Spectra is a mathematical construct in computability theory that classifies the Turing degrees of presentations of a given structure, thereby capturing the intrinsic computational complexity of that structure across all possible computable encodings.

34

Publications

1K

Citations

47

Authors

33

Institutions

Publications per year

2017–2026

4

Authors

47

  1. VH
    Valentina Harizanov

    George Washington University, United States

    5 publications · 117 citations

    5

    h-index

  2. DR
    Denis R. Hirschfeldt

    University of Chicago, United States

    4 publications · 213 citations

    4

    h-index

  3. AM
    Antonio Montalbán

    University of Chicago, United States

    4 publications · 68 citations

    4

    h-index

  4. IS
    I. Sh. Kalimullin

    Kazan Federal University, Russia

    4 publications · 90 citations

    4

    h-index

  5. BF
    Barbara F. Csima

    University of Waterloo, Canada

    3 publications · 45 citations

    3

    h-index

1–5 of 47

Venues

  1. Journal of Symbolic Logic

    6 publications · 114 citations

    6

    h-index

  2. Annals of Pure and Applied Logic

    5 publications · 290 citations

    5

    h-index

  3. Proceedings of the American Mathematical Society

    PROC · 4 publications · 90 citations

    4

    h-index

  4. Journal of Combinatorial Theory Series B

    3 publications · 109 citations

    3

    h-index

  5. Journal of Mathematical Logic

    2 publications · 35 citations

    2

    h-index

1–5