83 reputation
8
bio website
location
age
visits member for 1 year, 10 months
seen Sep 28 at 12:42

Jun
9
comment Write a grammar for language $a^ib^jc^k$
What is your question??? :) you solved that...
May
31
comment Context Free Grammar Equal Lengths
in definition of this language, must be written L={X#Y|X,Y $\in$ {0,1}* & |x|=|y|}
May
31
comment How many paths are there in graph $K_n$?
sorry, yeah. this set must be have at least two element. tnx
May
30
comment How many paths are there in graph $K_n$?
Set of vertices, without repeat.
May
30
comment Am I Right In My Calculation of the Worst Case of This Code?
what is your question??? i don't understand. yes. this algorithm is O(n) but, this algorithm do not belong to P class of computational complexity.
May
14
comment difference of 2 partial computable algorithms
i edited my question and write the main problem...
May
14
comment difference of 2 partial computable algorithms
is that ok? the main problem is this...
May
14
comment difference of 2 partial computable algorithms
i think this is not possible, but not similar your reason. your reason can omit by a simple paralleling this problem.
May
13
comment Complement of halting set is not r.e.
let us continue this discussion in chat
May
13
comment Complement of halting set is not r.e.
i'm sorry. now it is true.
May
13
comment Complement of halting set is not r.e.
No. suppose we don't know that Halting problem is not recursive, and we want to prove that "Complement of halting problem is not r.e." and now we find that "Halting problem is not recursive."
May
13
comment Complement of halting set is not r.e.
Can you prove that complement of halting set is not r.e. ???
May
13
comment Complement of halting set is not r.e.
:) i know that :)
May
12
comment Where is wrong in this proof
by omit this fact we can proof any of the number is equal to any of the other number
May
12
comment Where is wrong in this proof
yes.that's right
May
7
comment Rice's theorem_Theory of computation
tnx @fgp, but can you tell me(clearly), in rice theorem, exist 3 condition, 1) A=Set of number of turing machines, 2) A not equal to Empty, 3) A not equal to All of the partial computable function. just just just it. and my problem satisfied these condition, NOT???
May
7
comment Rice's theorem_Theory of computation
i know, but where is my wrong??? all of the condition of rice's theorem is satisfied in my problem, then >> this problem SHOULD be undecidable, but not, where is my WRONG??? i know this program is decidable, i not your example is undecidable , but can you tell me "why i cant use rice theorem?"