Computability

Computability is the property of a function or problem that determines whether it can be effectively calculated or solved by a mechanical process, specifically through the application of a finite, well-defined algorithmic procedure such as a Turing machine.

577

Publications

40.9K

Citations

751

Authors

450

Institutions

Publications per year

2017–2026

73

Variants

Effective Calculability

Authors

751

  1. KW
    Klaus Weihrauch

    FernUniversität in Hagen, Germany

    11 publications · 634 citations

    11

    h-index

  2. GJ
    Giorgi Japaridze

    Villanova University, United States

    13 publications · 461 citations

    11

    h-index

  3. HB
    Holger Boche

    Technical University of Munich, Germany

    11 publications · 225 citations

    11

    h-index

  4. VB
    Vasco Brattka

    University of Cape Town, South Africa

    9 publications · 594 citations

    9

    h-index

  5. MB
    Marian Boykan Pour‐El

    University of Minnesota, United States

    8 publications · 484 citations

    8

    h-index

1–5 of 751

Venues

  1. Theoretical Computer Science

    29 publications · 1.5K citations

    22

    h-index

  2. Journal of Symbolic Logic

    29 publications · 1.5K citations

    18

    h-index

  3. Bulletin of Symbolic Logic

    18 publications · 898 citations

    15

    h-index

  4. Mathematical logic quarterly

    MLQ · 19 publications · 581 citations

    15

    h-index

  5. Transactions of the American Mathematical Society

    TRAN · 17 publications · 2.1K citations

    15

    h-index

1–5