Questions tagged [semi-decidability]
The semi-decidability tag has no usage guidance.
1
vote
1answer
40 views
Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)?
Say $ \Sigma = \{a\} $, $M_1, M_2, ... $ is an enumeration of all TMs that recognize languages over $\Sigma$ and $L_1, L_2, ... $ are respectively the languages that are recognized by those TMs. We ...
1
vote
1answer
28 views
Recognizably turing machine question (reject / loop)
The definition of proving recognizability using dove tailing is below. However I'm wondering if we can also prove loop or reject in the same way?
Give a deterministic TM D that recognizes L such that ...
3
votes
1answer
53 views
Is the language of all TMs *not* accepting a given string, Enumerable?
Is the following language in RE?
$$L = \{\langle M\rangle : M\text{ is a TM that does not accept }010\}$$
I could use Rice's Theorem with the property $P = \{L : 010\text{ is not in }L\}$ to show ...
2
votes
1answer
33 views
How To Show That B is Semi-Decidable Given A
I am preparing for my Computational Theory final and ran into this exact problem :
B={ x | there exists a prefix of x that is in A}.
Show that B is semi-decidable. In other words, you need to ...
1
vote
1answer
219 views
Is it decidable whether a Turing machine M will reach state q on input s?
Given a turing machine $M$, one of its states $q$ and an input word $w$, will $M$ ever reach $q$ on $w$?
As we are not given anything about the word length, I assume that we have a finite length word....
2
votes
1answer
77 views
Prove the languages |L<M>| = 2 and |L<M>| $\not=$ 2 to be non-Turing recognizable or non-recursively enumerable
I am trying to prove the non-recursively enumerable property of two languages.
$L_2 = \{\langle M \rangle: |L\langle M \rangle| = 2\}$ and
$L_{\not=2} = \{\langle M \rangle: |L\langle M \rangle| \not=...
1
vote
1answer
68 views
Prove Halting on all Inputs is not in RE simulation
I don't understand why when proving if Halting on all inputs problem si not in RE using the complement of the halting problem, I have to take a turing machine and simulate the machine M(the machine ...
1
vote
1answer
45 views
REC and RE under intersection
Would the intersection of a recursive language and a recursively enumarable language be recursive or recurisvely enumbarable or neither?
Assume $L_{3}$ is the intersection of some language $L_{1}$ $\...
-3
votes
3answers
99 views
Does undecidability violate Turing completeness? Shouldn't “complete” include “decidability”? [closed]
Does undecidability violate Turing completeness? Shouldn't "complete" include "decidability"?
That is, if one has a language that's Turing complete, but expresses infinite computation (i.e. may not ...
1
vote
1answer
73 views
How do I construct a NTM that accepts the language consisting of the coding of turing machines that halt on one input?
I currently have a problem with the following question:
Let $L = \{ \langle M \rangle \mid \exists w: \text{$M$ halts for $w$ in at most $|w|^3$ steps} \}$.
Construct an NTM (non-deterministic Turing ...
4
votes
1answer
73 views
Is Rice-Shapiro theorem bidirectional?
Rice-Shapiro theorem states that
version A
Let $\Gamma$ be a set of computably enumerable sets, and $I = \{e : W_e \in \Gamma\}$ its index set in some admissible enumeration of c.e sets. If $I$...
1
vote
1answer
76 views
Can the complement of an unrecognizable language be a recognizable language?
I know that complement of a language that is recursively enumerable, but not recursive, is definitely not recursively enumerable (or unrecognizable). So my question is what can be said about the ...
1
vote
2answers
127 views
Why are not all recursive languages undecidable?
I learned that recursive language are decidable; correct me if I am wrong. However, I have found some arguments that seem to contradict this. These may or may not be correct; please let me know.
If ...
0
votes
0answers
28 views
A set that is not recursively enumerable and not (K'≤ A)
Is there a set A such that it's not recursively enumerable and not(K'≤ A) ?
where K' is complement of K= {n| φ n (n) halts}
Thanks!
0
votes
0answers
23 views
How to know if a lanugae is undecidable or semi-decidable
I recently learnt about undecidable languages and semi-decidable languages. But I am still quite confused on how I can determine if a language is semi-decidable. Is there any standard theorem or axiom ...
3
votes
1answer
85 views
Efficient algorithm to determine if a lambda calculus term is equivalent to one without a given free variable
Consider the following problem: given a lambda calculus term $t$ and free variable $v$ determine whether $\phi(t,v)$, where $\phi(t,v) := \exists t'. t' \equiv t \land v \notin FV(t')$.
This problem ...
0
votes
1answer
42 views
Need help understanding what co-recursively enumerable means
Lets say I have a set: $ L = \{\langle G \rangle | L(G) = \sum^{\star}\}$ and the question asks if it is co-RE. I know that if something is co-RE, it halts on every input not in L but may or may not ...
1
vote
1answer
39 views
Is the set of context free grammars that generate all words in co-RE?
Is $\{\langle G \rangle | L(G) = \sum^{\star}\}$ in co-RE? $\langle G \rangle$ is the encoding of a context free grammar. My intuition is that this is false.
0
votes
1answer
55 views
Whether language of all turing machines is decidable or undecidable or semi-decidable?
I recently came across this language:
$L=\{<TM>| \text{TM accepts recursively enumerable languages}\}$
It was asked in the question to find out whether language L is decidable or undecidable.
...
0
votes
1answer
111 views
Prove/disprove that the class of decidable (resp. partially decidable) languages is closed under symmetric difference
Prove/disprove that the class of decidable (resp. partially decidable) languages is closed under symmetric difference. A symmetric difference of sets A and B is the set (A \ B) ∪ (B \ A).
I know that ...
0
votes
1answer
90 views
Proving a set is semi-decidable
Let $S = \{ ⟨M,q⟩ | (\exists x) M $ reaches state $q$ when running $M$ on $x$$\}$, where ⟨M,q⟩ is coded TM M and state q.
To prove that $S$ is semi-decidable, I've tried to use the equivalence:
...
2
votes
1answer
441 views
Determining if given languages are regular or recursively enumerable
I came across following problem:
Suppose $L_1$ and $L_2$ are two languages, $M$ is a Turing machine
$L_1 =\{M|M$ accepts at most 2016 strings$\}$
$L_2=\{M|M$ accepts at least 2016 strings$\}$
...
1
vote
3answers
301 views
Proof that total computable functions are not enumerable
In an answer to this question, a sketch of the proof that total computable functions are not enumerable is made:
Because of diagonalization. If $(f_e:e \in N)$ was a computable enumeration of all ...
2
votes
1answer
47 views
When does an extendible 1:1 p.c. function have a 1:1 computable extension?
A partial computable function $\varphi_e$, defined on a c.e. set $W_e$, is called extendible if there exists some computable function $f$ which extends $\varphi_e$, i.e. $\varphi_e(W_e) = f(W_e)$.
My ...
2
votes
1answer
61 views
If Q1 and Q2 are countably enumerable, then is Q1\Q2 countably enumerable?
If Q1 and Q2 are countably enumerable, then is Q1\Q2 countably enumerable?
I am reading a text where they claim that this is not the case and ask the reader to come up with a counter example.
Can ...
0
votes
1answer
337 views
Why is the intersection of these two Languages Recursively Enumerable, not Recursive?
I am only several days exposed to computational theory, so my understanding is quite slim: in a question, it says that for a regular language L1 and a recursively enumerable but not recursive language ...
-2
votes
1answer
33 views
Show that $L = L_\phi \cup L_{\{\sum^*\}} \notin RE$ with Rice theorem
Show that $L = L_\phi \cup L_{\{\sum^*\}} \notin RE$ with Rice theorem.
Well I did show that with reduction, by using $HP'$.
Simply by creating a function from $f(\langle M \rangle, x) = (M')$
Thus,...
1
vote
1answer
665 views
What is the difference between undecidable language and Turing Recognizable language?
I was wondering what is the difference difference undecidable language and Turing recognizable language. I've seen in some cases where they ask:
Prove that the language $ A_{TM} = \{ \ <M,w> | \...
0
votes
0answers
28 views
How to prove that for a decidable problem the problem and the compliment of the problem are semi-decidable?
Given a decidable problem, how would I go about proofing that the problem and the complement of the problem have to be semi-decidable?
1
vote
1answer
534 views
Closure of Turing-recognizable languages under homomorphism
I've proven that the Turing-recognizable languages are closed under concatenation and I need to show that they are closed under homomorphism.
But what's really the difference? Doesn't closure under ...
0
votes
1answer
64 views
Does the language of TM's that repeat a configuration infinite times semi-decidable or not?
Let us define the following languages:
$$ {L_1 = \{\langle M\rangle : M \ \text{is a TM and $\exists w\in \Sigma^*$ s.t $M(w)$ repeats a configuration infinite times}\}} $$
$$ L_2 = \{\langle M\...
0
votes
0answers
206 views
Decidability of intersection of two languages of same type
Given two context-sensitive languages, $L_1$ and $L_2$ is the problem of "whether $L_1 \cap L_2$ also belongs to CSL" decidable?
I have the same question for the case when $L_1$ and $L_2$ belongs to ...
0
votes
0answers
22 views
Give an example of a language where both L and ¬L is not semidecidable? [duplicate]
I know ¬H is not semidecidable so I was thinking of creating a language that combines both H and ¬H. Therefore L would be undecidable for ¬H and ¬L would be undecidable for H. Is this a proper ...
0
votes
2answers
45 views
Function whose domain is strictly included in its range
Hi I'm doing some exercices on reductions and one of them is like this:
My problem rather than doing the reduction is understanding it. For the positive case I want that if Mx(x) never stops then p'...
0
votes
0answers
35 views
Is the language below not decidable , if yes , it is then R.E ?
I am given a Turing machine M as input and i have to find out if this language below decidable and if not is it then in this case recursively enumerable .
$$L=\\\{<M> \mid \text{ is ...
0
votes
1answer
79 views
Prove that an infinite set is semidecidible
I have been asked to prove that:
Being C an infinite set. Prove that C is semidecidable if and only if exists a total computable function that is injective and whose image is C.
I've read the ...
2
votes
1answer
107 views
Completeness problem of TM
$L = \{ \langle M \rangle \mid L(M) = \Sigma^∗ \}$
Is above problem R.E ?
I found an explanation in one of the websites and I have doubt in few lines of paragraph.
The explanation was
Now, given a ...
1
vote
1answer
448 views
If a problem is “not semi-decidable” and “not decidable” can we say it is “undecidable”?
I was under impression that when a Language (or problem) is not semi-decidable and not decidable then we can say it's undecidable and I think it makes sense also based on diagram.
However, in my ...
0
votes
0answers
77 views
Decidability of {(M,w); M terminates on input w and tape of M is empty after computation}
I am currently trying to prove whether the above language is decidable, partially decidable or fully undecidable. I am certain that this language is partially decidable and reducible to the halting ...
0
votes
0answers
151 views
Turing machine accepts two different strings
I am having hard time to proving this problem
$C=\{\langle M \rangle \mid M \text{ is a Turing Machine , } L(M) \text { only contains two different strings}\}$
some ideas that i have tried are :
i ...
0
votes
0answers
53 views
Prove whether this language is (partially) decidable [duplicate]
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|$ ...
3
votes
2answers
495 views
Showing that the language $L = \{\langle M, w \rangle\ |\ M$ moves left at least three times while computing $w \}$ is decidable or undecidable
How would you go about showing that the language $L = \{\langle M, w \rangle\ |\ M$ moves left at least three times while computing $w \}$ is decidable or undecidable?
Intuitively my thoughts are ...
1
vote
2answers
104 views
Enumerable disjoint subsets whose union is equal to the union of the sets
I'm given that two sets, $A$ and $B$ are enumerable. I have to show that there exist subsets $A \supset C$ and $B \supset D$ ($C$ and $D$ also enumerable) such that $C$ and $D$ are disjoint and $A\cup ...
14
votes
3answers
3k views
Are there any countable sets that are not computably enumerable?
A set is countable if it has a bijection with the natural numbers, and is computably enumerable (c.e.) if there exists an algorithm that enumerates its members.
Any non-finite computably enumerable ...
3
votes
1answer
262 views
The Church-Turing-Thesis in proofs
Currently I'm trying to understand a proof of the statement:
"A language is semi-decidable if and only if some enumerator enumerates it."
that we did in my lecture. One direction of the proof goes ...
1
vote
0answers
38 views
The set of words accepted by TMs simultaneously is finite is non semi-decidable
Consider $L = \{(M_1,M_2):\text{the set of words accepted by both TM at the same time is finite}\}$. I want to determine if this language is decidable, semi-decidable or not semi-decidable.
My ...
2
votes
1answer
150 views
Semi decidability proof
I'm studying for my theory of computation exam and came accross the following question:
Construct an appropriate Turing machine for the following language and prove or disprove it's semi-decidability:...
7
votes
1answer
3k views
Why is the halting problem semi-decidable?
This is what is know about halting problem and semi-decidability :-
Halting problem says that for a given input x and a machine H, we can't say whether the machine H halts or not on input x.
A ...
1
vote
1answer
130 views
Unrecognizable languages relationship to NP-hard languages
I would like to know if there exists an NP-hard language which is also a member of co-RE\R?
I think it depends if P=NP or not, but i'm not sure.
Can I simply assume NP-hard is in R?
Can you direct ...
0
votes
1answer
444 views
Is it decidable whether a Turing Machine will visit every non-end state from input x?
L = {w#x | w,x ∈{0,1}∗ and Turing Machine Mw with input x visits every non-end state at least once}
I believe this problem is undecidable.
My proof would consist of me reducing L to a Halting ...
