Rice's theorem
English
    
    Etymology
    
Named after Henry Gordon Rice, who proved it in 1951.
Proper noun
    
- (computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.
 
Anagrams
    
    This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.