# What evidence is there that $coRP \neq NP$?

What evidence is there that $coRP \neq NP$?

$coRP$ is the class of languages for which there exists a probabililistic Turing Machine that runs in polynomial time and always answers Yes on an input belonging to the language and answers No with probability at least one half on an input not belonging to the language.

• I think that a little bit of background, or what googling turned up, or both, would make this question much better. Aug 21 '10 at 0:18
• $coR$ as in the complement of the Recursive Languages, as in the complement of set of problems solvable by a Turing machine? Aug 21 '10 at 2:50
• I think coR is the old name for the class now called coRP. Aug 21 '10 at 5:31
• Sorry for the confusion. See the update. Aug 21 '10 at 10:26