Rice theorem, the proof of the part when the empty language belongs to the property

I was going through the classic text “Introduction to Automata Theory, Languages, and Computation” by Hofcroft, Ullman and Motwani where I came across the proof the Rice theorem as shown.

$ L_u$ => Language accepted by universal turing machine

$ P$ => property of a regular language

$ L_P$ => set containing the codes of the turing machines which accept those languages in $ P$

Theorem : (Rice’s Theorem) Every nontrivial property of the RE languages is undecidable.

PROOF: Let $ P$ be a nontrivial property of the $ RE$ languages. Assume to begin that $ \phi$ , the empty language, is not in $ P$ . we shall return later to the opposite case. Since $ P$ is nontrivial, there must be some nonempty language $ L$ that is in $ P$ . Let $ M_L$ be a $ TM$ accepting $ L$ . We shall reduce $ L_u$ to $ L_P$ , thus proving that $ L_P$ is undecidable, since $ L_u$ is undecidable. The algorithm to perform the reduction takes as input a pair $ (M,w)$ and produces a $ TM$ $ M’$ . The design of $ M’$ is suggested by Fig; $ L(M’)$ is $ \phi$ if $ M$ does not accept $ w$ , and $ L(M’)$ = $ L$ if $ M$ accepts $ w$ .

Construction of M' for the proof of Rice's Theorem

$ M’$ is a two-tape $ TM$ . One tape is used to simulate $ M$ on $ w$ . Remember that the algorithm performing the reduction is given $ M$ and $ w$ as input, and can use this input in designing the transitions of $ M’$ . Thus, the simulation of $ M$ on $ w$ is “built into” $ M’$ ; the latter $ TM$ does not have to read the transitions of $ M$ on a tape of its own. The other tape of $ M’$ is used to simulate $ M_L$ on the input $ x$ to $ M’$ , if necessary. Again, the transitions of $ ML$ are known to the reduction algorithm and may be “built into” the transitions of $ M’$ . The $ TM$ $ M’$ is constructed to do the following:

  1. Simulate $ M$ on input $ w$ . Note that $ w$ is not the input to $ M’$ rather, $ M’$ writes $ M$ and $ w$ onto one of its tapes and simulates the universal $ TM$ $ U$ on that pair. If $ M$ does not accept $ w$ , then $ M’$ does nothing else. $ M’$ never accepts its own input, $ x$ , so $ L(M’) = \phi$ . Since we assume $ \phi$ is not in property $ P$ , that means the code for $ M’$ is not in $ L_P$ .

  2. If $ M$ does not accept $ w$ , then $ M’$ does nothing else. $ M’$ never accepts its own input, $ x$ , so $ L(M’) =\phi$ . Since we assume $ \phi$ is not in property $ P$ , that means the code for $ M’$ is not in $ L_P$ .

  3. If $ M$ accepts $ w$ , then $ M’$ begins simulating $ M_L$ on its own input $ x$ . Thus, $ M’$ will accept exactly the language $ L$ . Since $ L$ is in $ P$ , the code for $ M’$ is in $ L_P$ .

Constructing $ M’$ from $ M$ and $ w$ can be carried out by an algorithm. Since this algorithm turns $ (M,w)$ into an $ M’$ that is in $ L_P$ if and only if $ (M,w)$ is in $ L_u$ , this algorithm is a reduction of $ L_u$ to $ L_P$ , and proves that the property $ P$ is undecidable.

We are not quite done. We need to consider the case where $ \phi$ is in $ P$ . If so, consider the complement property $ \overline P$ , the set of $ RE$ languages that do not have property $ P$ . By the foregoing, $ \overline P$ is undecidable. However, since every $ TM$ accepts an $ RE$ language, $ \overline {L_P}$ , the set of (codes for) Turing machines that do not accept a language in P is the same as $ L_{\overline P}$ , the set of TM’s that accept a language in $ \overline P$ . Suppose $ L_P$ were decidable. Then so would be $ \overline {L_P}$ , because the complement of a recursive language is recursive.

I could not understand the last paragraph in bold.

Rice Noodle Production Line factory

Company overview
WUHAN G-YOUNG INDUSTRY&TRADE CO., LTD is a domestic professional manufacturer and export trader which in researching, developing, producing all kinds of instant noodle machine, fine dried noodles machine and so on. Our main products is fried instant noodle production line, non-fried instant noodle production line, Low- Temperature Hanging-Type Drying Noodle Production Line, Low- Temperature Chain Cable-Style Noodle Production Line, fresh noodles production line and other kinds of noodle production equipment. It located in Wuhan, the largest city in the middle of China, and an important industrial base of China, which has long history, advantaged natural resources, convenient Transportation and has the reputation as the thoroughfare leading to nine provinces. And the production base is located in the central city of Zhengzhou which enjoys the reputation of “noodle’s city”. It is just because of the perfect combination with the headquarter in terms of technology, transportation and talents that created the sales’ miracle of the company.
Our products are sold well throughout the 20 provinces, the city, the autonomous region in China, as Southeast Asia, West Africa, and the Middle East, the European Union, and other countries and regions. The quality of the products and services has been consistent high praised by domestic and foreign customers. We sincerely hope to cooperate with more customers, hand in hand together, and try our best to make the company become a comprehensive value-added ability and composite competitive global manufacturers and traders.

Our Main Products
Stick Noodle Production Line
Fried Instant Noodle Production Line
Non-Fried Instant Noodle Production Line
Manual Noodle Production Line
Fresh Noodle Production Line
Vermicelli production line
Spaghetti production line
Macaroni pasta production line

Product Application

Our Certificate
Quality System Certificate
CE Certificate
Patent Certificate Of Vermicelli Low-Temperature Drying Conveyor
Patent Certificated Of Below Noodles Machines Shelves
Patent Certificated Of Upper Noodles Machines Shelves
Patent Certificated Of Vermicelli Machine And Pneumatic Machine Cross-Section

Our service
Pre-Sales Service
* Inquiry and consulting support.
* Sample testing support.
* View our Factory.
* professional  R&D teams

After-Sales Service
* Training how to install the machine.
* Engineers available to service machinery overseas.
* One year warranty, life time maintenance with low cost price.
* Free easy broken spare parts will be sent with container .
* First installation can be guided by engineer.
* Training workers in customer’s factory.
Rice Noodle Production Line factory

Correct Turing machine representation for Rice Theorem proof

Consider the language L1. From Rice Theorem I know L1 is not decidable (i.e. undecidable).

L1 = { R(M) | R(M) is a TM and 1011 ∈ L(M)}

For example if I want to represent by diagram a TM $ M_1$ that accepts the string 1011 and a TM $ M_2$ that doesn’t accept the string 1011 (e.g., $ M_2$ accepts only the empty string), following the Rice Theorem not-trivial property, I need to use a (1) acceptance by final states or (2) acceptance by halting or (3) I can use both because I know (by theorem) they are equivalent?

rice cooker 26383097


rice cooker 26383097

rice cooker 34709753


rice cooker 34709753

rice cooker 00153244


rice cooker 00153244

rice cooker 09236714


rice cooker 09236714

rice cooker 31289858


rice cooker 31289858

rice cooker 56964783


rice cooker 56964783

rice cooker 52005329


rice cooker 52005329