210 views

1 Answer

0 votes
0 votes

A property that holds for every machine or holds for none is trivial. Rice's theorem does not apply to such a property.

To see why, note that such a property can be decided by a very simple Turing machine, which accepts/rejects every Turing machine representation.

Source: https://cs.stackexchange.com/questions/19536/rice-theorem-what-is-non-trivial-property?noredirect=1&lq=1

Related questions

0 votes
0 votes
0 answers
1
sripo asked Jan 5, 2019
523 views
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
0 votes
0 votes
0 answers
2
2 votes
2 votes
1 answer
3
srestha asked Nov 29, 2017
1,018 views
L1={<M>| M is a Turing Machine , P is a TM that halts on all input, and P$\epsilon$L(M)}L2={<M>| M is a Turing Machine , P is a TM that halts on all input, and M$\epsilon...
0 votes
0 votes
2 answers
4
Mk Utkarsh asked Nov 26, 2017
2,011 views
If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ?