OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Rice's theorem

 Home Mathematics Fields of mathematics Foundations of mathematics Theorems in the foundations of mathematics
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Rice's theorem is a fundamental result in computability theory that addresses the limits of what can be determined about the behavior of Turing machines and languages recognized by them. Specifically, the theorem states that any non-trivial property of the languages recognized by Turing machines is undecidable.

 Ancestors (5)

  1. Theorems in the foundations of mathematics
  2. Foundations of mathematics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook