Rice's theorem
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named 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.