Decidability of subsets [closed]Decidability of regularity of context-free grammarCan you prove a theorem by proving it’s undecidable? (Numberphile question)Proving the decidability of a languageThe elementary theory of finite commutative ringsLiterature about decidable and undecidable theoriesDo given Turing Machines M,N accepts equinumerous languages?Prove whether the problem is decidableThe (un)decidability of the Tits Alternative for any given (suitably defined) set of groups.Proving the diagonalization of $U subset mathbbN times mathbbN$ that is an universal set for all enumerable sets of naturals is undecidableUndecidability of: $|w in L| geq 1, L=w in 0,1^*$
OA final episode explanation
Are objects structures and/or vice versa?
extract characters between two commas?
Is Fable (1996) connected in any way to the Fable franchise from Lionhead Studios?
I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine
Check if two datetimes are between two others
What to wear for invited talk in Canada
Copycat chess is back
What does "enim et" mean?
Latin words with no plurals in English
Are cabin dividers used to "hide" the flex of the airplane?
Landlord wants to switch my lease to a "Land contract" to "get back at the city"
Weird behaviour when using querySelector
Why do we use polarized capacitors?
How to move the player while also allowing forces to affect it
Is every set a filtered colimit of finite sets?
Information to fellow intern about hiring?
Why is the design of haulage companies so “special”?
How would photo IDs work for shapeshifters?
Can I find out the caloric content of bread by dehydrating it?
Why doesn't a const reference extend the life of a temporary object passed via a function?
Why airport relocation isn't done gradually?
Does the average primeness of natural numbers tend to zero?
Some basic questions on halt and move in Turing machines
Decidability of subsets [closed]
Decidability of regularity of context-free grammarCan you prove a theorem by proving it’s undecidable? (Numberphile question)Proving the decidability of a languageThe elementary theory of finite commutative ringsLiterature about decidable and undecidable theoriesDo given Turing Machines M,N accepts equinumerous languages?Prove whether the problem is decidableThe (un)decidability of the Tits Alternative for any given (suitably defined) set of groups.Proving the diagonalization of $U subset mathbbN times mathbbN$ that is an universal set for all enumerable sets of naturals is undecidableUndecidability of: $|w in L| geq 1, L=w in 0,1^*$
$begingroup$
L1 is undecidable and L1 ⊆ L2
then if L2-L1 is decidable leads to that L2 is undecidable
I know that this is true, but how to prove this?
number-theory decidability
$endgroup$
closed as off-topic by Saad, K B Dave, John Omielan, Shailesh, Lord Shark the Unknown Mar 30 at 3:20
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, K B Dave, John Omielan, Shailesh
add a comment |
$begingroup$
L1 is undecidable and L1 ⊆ L2
then if L2-L1 is decidable leads to that L2 is undecidable
I know that this is true, but how to prove this?
number-theory decidability
$endgroup$
closed as off-topic by Saad, K B Dave, John Omielan, Shailesh, Lord Shark the Unknown Mar 30 at 3:20
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, K B Dave, John Omielan, Shailesh
add a comment |
$begingroup$
L1 is undecidable and L1 ⊆ L2
then if L2-L1 is decidable leads to that L2 is undecidable
I know that this is true, but how to prove this?
number-theory decidability
$endgroup$
L1 is undecidable and L1 ⊆ L2
then if L2-L1 is decidable leads to that L2 is undecidable
I know that this is true, but how to prove this?
number-theory decidability
number-theory decidability
asked Mar 30 at 2:08
js wangjs wang
41
41
closed as off-topic by Saad, K B Dave, John Omielan, Shailesh, Lord Shark the Unknown Mar 30 at 3:20
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, K B Dave, John Omielan, Shailesh
closed as off-topic by Saad, K B Dave, John Omielan, Shailesh, Lord Shark the Unknown Mar 30 at 3:20
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Saad, K B Dave, John Omielan, Shailesh
add a comment |
add a comment |
0
active
oldest
votes
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes