Rice's theorem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Etymology

[edit]

Named after Henry Gordon Rice, who proved it in 1951.

Proper noun

[edit]

Rice's theorem

  1. (computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.

Anagrams

[edit]