This preview shows page 1. Sign up to view the full content.
Unformatted text preview: is not empty} is undecidable using (i) Rice theorem (ii) A direct reduction without using the Rice theorem. 9. Show that the following problem about programs in a real programming language is undeciable: " Whether two programs produce the same output on all inputs."...
View Full Document
This note was uploaded on 07/25/2008 for the course CSE 860 taught by Professor Chung during the Spring '04 term at Michigan State University.
- Spring '04