##  [Rice's Theorem](/rices-theorem) 

  ##  [Rice's Theorem](https://natural.quantumdictionary.io/rices-theorem-0) 

  

 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/topic-specific-dictionaries/natural-formal-sciences)



**Natural & Formal Sciences Dictionary**

 







 

 

 

 



 

 

 

 

Definition

A theorem in computability theory asserting that every nontrivial semantic property of the language recognized by a Turing machine is undecidable: no algorithm can decide, for an arbitrary Turing machine, whether the language it accepts has that property, provided the property depends only on the language and is nontrivial.