Rice's Theorem

Rice's Theorem is a fundamental result in computability theory stating that any non-trivial semantic property of programs recognized by Turing machines is undecidable.

13

Publications

1.1K

Citations

21

Authors

23

Institutions

Publications per year

2017–2026

1

Authors

21

  1. KG
    Kurt Gödel

    Institute for Advanced Study, Germany

    3 publications · 808 citations

    3

    h-index

  2. BD
    Bernard D. Meltzer

    University of Edinburgh, United Kingdom

    2 publications · 642 citations

    2

    h-index

  3. JL
    John L. Lumley

    Cornell University, United States

    1 publications · 26 citations

    1

    h-index

  4. JM
    J. Manz

    Freie Universität Berlin, Germany

    1 publications · 22 citations

    1

    h-index

  5. AA
    Andrea Asperti

    University of Bologna, Italy

    1 publications · 26 citations

    1

    h-index

1–5 of 21

Venues

  1. Journal of Symbolic Logic

    3 publications · 112 citations

    3

    h-index

  2. 1

    h-index

  3. The Journal of Chemical Physics

    1 publications · 22 citations

    1

    h-index

  4. American Mathematical Monthly

    1 publications · 53 citations

    1

    h-index

  5. Proceedings of the ACM on Programming Languages

    PACMPL · 1 publications · 27 citations

    1

    h-index

1–5