Undecidability

Undecidability is a property of decision problems in computability theory, distinguished by the absence of a Turing machine that can always determine, in finite time, whether an arbitrary input belongs to a given set.

437

Publications

24.8K

Citations

623

Authors

339

Institutions

Publications per year

2017–2026

39

Authors

623

  1. TH
    Tero Harju

    University of Turku, Finland

    5 publications · 123 citations

    5

    h-index

  2. VH
    Vesa Halava

    University of Turku, Finland

    5 publications · 71 citations

    5

    h-index

  3. JM
    Jerzy Marcinkowski

    University of Wrocław, Poland

    4 publications · 104 citations

    4

    h-index

  4. JC
    Julien Cassaigne

    Institut de Mathématiques de Marseille, France

    4 publications · 142 citations

    4

    h-index

  5. PB
    Patricia Bouyer

    Centre National de la Recherche Scientifique, France

    4 publications · 160 citations

    4

    h-index

1–5 of 623

Venues

  1. Journal of Symbolic Logic

    32 publications · 2K citations

    21

    h-index

  2. Theoretical Computer Science

    26 publications · 3K citations

    18

    h-index

  3. arXiv (Cornell University)

    Repository · 10 publications · 141 citations

    10

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 9 publications · 228 citations

    9

    h-index

  5. Annals of Pure and Applied Logic

    8 publications · 326 citations

    8

    h-index

1–5