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
13
On Formally Undecidable Propositions of Principia Mathematica and Related Systems I
Kurt Gödel · 1930 · 166 citations
Humanities, Mathematics, Philosophy +14
On effective topological spaces
Dieter Spreen · Journal of Symbolic Logic · 1998 · 66 citations
Generic complexity of undecidable problems
Alexei Myasnikov, Alexander Rybalov · Journal of Symbolic Logic · 2008 · 36 citations
1–5 of 13
21
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 21
23
Centrale Marseille
Marseille, France
1 h-index
2 publications
30 citations
Aix-Marseille Université
Marseille, France
1 h-index
2 publications
30 citations

McGill University
Montreal, Canada
1 h-index
1 publications
36 citations

Folkwang University of the Arts
Essen, Germany
1 h-index
1 publications
66 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
26 citations
Russian Academy of Sciences
Moscow, Russia
1 h-index
1 publications
36 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
1 h-index
2 publications
54 citations
Château Gombert
Marseille, France
1 h-index
1 publications
15 citations
1–8 of 23
3 publications · 112 citations
3
h-index
1 publications · 26 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 53 citations
1
h-index
PACMPL · 1 publications · 27 citations
1
h-index
1–5