The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
25 views

Which of the following decision problems are undecidable?

asked in Theory of Computation by (427 points) | 25 views
+1

1 Answer

0 votes
p1 and p2 is undecidable
answered by Active (2.4k points)
edited by
0
How first one is undecidable?
0
first one is similar to post correspondence problem .At first we take a string from L(G1) and search into L(G2)  which become undecidable.

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
47,913 questions
52,294 answers
182,250 comments
67,742 users