0

I'm currently working on a few turing machine exercises and I can't understand how I can prove whether the below is at least partially decidable:

$\{M \mid L(M) = \{x \mid |x| = 10\}\;\}$ where $|x|$ is the length of word $x$

Can anyone explain to me what the above statement actually means and an idea of how to go about it please?

Vor
  • 12,513
  • 1
  • 30
  • 60
Ponsietta
  • 111
  • 2
  • This statement means the set of TM indexes (natural numbers under some fixed encoding) where each TM accepts a language containing all strings of length $10$. – fade2black Nov 03 '17 at 19:31
  • Usually, positive answers are justified by crafting a semidecider. Negative answers often are justified by Rice-Shapiro (if your course cover that) or explicit reduction from some known non-semidecidable problem (e.g. the complement of the halting problem). – chi Nov 03 '17 at 21:16
  • Another way to explain it, "${x \mid |x| = 10}$ is the (finite) set of strings of length $10$. $L(M)$ represents the language accepted by $M$. $A = { M \mid ...\mbox{ someproperty }... }$ represents the set of Turing machines that satisfy "someproperty". Your question is: given a Turing machine $M$ does there exist an algorithm that is able to halt if $M$ accepts exactly the strings of length $10$ and rejects all the strings longer or shorter than $10$? If yes then $A$ is partially decidable. – Vor Nov 04 '17 at 20:08
  • Thank you to all of you, particularly @Vor as the notation was confusing me. I am now assuming that this is provable using the halting problem. – Ponsietta Nov 04 '17 at 21:02
  • @Ponsietta: or you can directly apply the Rice theorem (if you already studied it) – Vor Nov 04 '17 at 23:10
  • @Vor yes we did the Rice theorem, however doesn't that just prove undecidability rather than partial decidability? – Ponsietta Nov 06 '17 at 07:41
  • ... yes, it's undecidable :-) – Vor Nov 06 '17 at 07:46
  • aa that explains it :P – Ponsietta Nov 06 '17 at 15:54

0 Answers0