LearnViz CompSci
Home / Learn / Theory & Discrete Math / Rice's Theorem

Intermediate Topic 33 of 51 Theory & Discrete Math

Rice's Theorem

Every nontrivial semantic program property is undecidable.

How it works

Rice's theorem states that every non-trivial semantic property of programs is undecidable. A property is semantic if it depends only on the function or language the program computes, not on its code text, and non-trivial if some programs have it and some do not. Examples: whether a program halts on all inputs, computes a constant function, accepts the empty string or is equivalent to another program. The proof reduces from the halting problem.

Step-by-step walkthrough

  1. A semantic property is about what a program does, not its text.
  2. Some programs have it and some do not, so it is nontrivial.
  3. Rice says no algorithm can decide it for every program.
  4. Examples: does it halt, does it compute squares, is it a virus.
  5. Only syntactic checks such as length are decidable.

Where it is used

It explains the limits of static analysis, program verification, malware detection, optimizing compilers and automatic grading: no tool can perfectly decide such properties for all programs.

Common pitfall

Syntactic properties, such as whether the code contains a certain statement or has more than 100 lines, are decidable and not covered. The theorem does not forbid tools from working on restricted languages or giving approximate answers with false positives or negatives. Apply it only to properties of the computed behavior and check non-triviality.

Where it fits in the course

Rice's Theorem is topic 33 of 51 in Theory & Discrete Math, rated Intermediate. It follows Reductions. The next topic is Complexity Classes.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Theory & Discrete Math quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Rice's Theorem?
Every nontrivial semantic program property is undecidable. It belongs to Theory & Discrete Math and is an intermediate-level topic.
Where do people use Rice's Theorem?
It explains the limits of static analysis, program verification, malware detection, optimizing compilers and automatic grading: no tool can perfectly decide such properties for all programs.
What is the most common mistake with Rice's Theorem?
Syntactic properties, such as whether the code contains a certain statement or has more than 100 lines, are decidable and not covered.
What should I learn before this topic?
Start with Reductions, the topic just before it in Theory & Discrete Math.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Theory & Discrete Math quiz.
Is Rice's Theorem hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Rice's Theorem?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Rice's Theorem?
Reductions, Complexity Classes, Halting Problem are closely connected. The full list is in the related topics section of this page.
What should I study after Rice's Theorem?
Continue with Complexity Classes, the next topic in Theory & Discrete Math.

Related topics