Rice's theorem
English
editEtymology
editNamed after Henry Gordon Rice, who proved it in 1951.
Proper noun
edit- (computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable.
Named after Henry Gordon Rice, who proved it in 1951.