The Gateway to Computer Science Excellence
0 votes
12 views
Rice’s theorem. Let $P$ be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine’s language has property $P$ is undecidable. In more formal terms, let $P$ be a language consisting of Turing machine descriptions where $P$ fulfills two conditions. First, $P$ is nontrivial—it contains some, but not all, $TM$ descriptions. Second, $P$ is a property of the $TM’s$ language—whenever $L(M_{1}) = L(M_{2})$, we have $\langle M_{1}\rangle \in P$ iff $\langle M_{2}\rangle \in P$ . Here, $M_{1}$ and $M_{2}$ are any $TMs$. Prove that $P$ is an undecidable language.
in Theory of Computation by Veteran (55k points) | 12 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,601 answers
195,852 comments
102,211 users