Computable Reducibility

Computable Reducibility is a formal relation in computability theory that classifies decision problems by permitting one problem to be algorithmically transformed into another via a computable function, thereby establishing relative solvability in terms of Turing reducibility.

120

Publications

5.2K

Citations

170

Authors

132

Institutions

Publications per year

2017–2026

14

Authors

170

  1. AP
    Arno Pauly

    University of Cambridge, United Kingdom

    4 publications · 108 citations

    4

    h-index

  2. VB
    Vasco Brattka

    University of Cape Town, South Africa

    4 publications · 338 citations

    4

    h-index

  3. VH
    Valentina Harizanov

    George Washington University, United States

    4 publications · 152 citations

    4

    h-index

  4. UA
    Uri Andrews

    University of Wisconsin–Madison, United States

    4 publications · 104 citations

    4

    h-index

  5. AM
    Antonio Montalbán

    University of Chicago, United States

    4 publications · 144 citations

    4

    h-index

1–5 of 170

Venues

  1. Theoretical Computer Science

    13 publications · 763 citations

    13

    h-index

  2. Journal of Symbolic Logic

    11 publications · 354 citations

    10

    h-index

  3. Algebra and Logic

    9 publications · 335 citations

    8

    h-index

  4. Annals of Pure and Applied Logic

    5 publications · 154 citations

    5

    h-index

  5. Transactions of the American Mathematical Society

    TRAN · 5 publications · 225 citations

    5

    h-index

1–5