First time here? Checkout the FAQ!
+1 vote
For Rice's Theorem to prove the language is undecidable for the following :

(1) L(M) has at least 10 strings

We can have Tyes for Σ∗ and Tno for ϕ. Hence, L={M∣L(M) has at least 10 strings} is not Turing decidable (not recursive). (Any other Tyes and Tno would also do. Tyes can be any TM which accepts at least 10 strings and Tno any TM which doesn’t accept at least 10 strings )

My question is how to design this TM which will accept simga* as well as keep count that the no. of strings are >=10 ( In other words how to prove the above using Rice's theorem)
asked ago in Theory of Computation by (125 points) 3 | 16 views

Please log in or register to answer this question.

No related questions found

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
Top Users Oct 2017
  1. Arjun

    23338 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7912 Points

  4. srestha

    6238 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4968 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4286 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points

Recent Badges

Popular Question user1234
Copy Editor Ayush Upadhyaya
Popular Question asu
Popular Question .
Popular Question makhdoom ghaya
Popular Question junaid ahmad
Notable Question learner_geek
Notable Question jothee
Popular Question jothee
Notable Question Jeffrey Jose
27,290 questions
35,142 answers
33,231 users