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
- Spring '04
- Computer program, Halting problem, Rice theorem