$P$ means polynomial complexity.
$S\_p$ is class of all $P$\_random sets, and $S\_{pc}$ is class of all $P$ incomputable sets, is $S\_{pc} \setminus S\_p$ empty? If not empty, any example?


what is the result, if we replace $P$ complexity with $NP$?


Moreover, $S$ is class of all random sets, and $S\_c$ is class of all incomputable sets, $S\_{c}\setminus S $ is not empty, what is a set in the class $S\_{c}\setminus S $,an immune set, productive set, or set of any other kind.



Are all $P$-noncomputable sets $P$-random?
No, the differences are not empty. As an example, take any noncomputable sequence such that every bit is repeated. That is, the $(2n)$th bit is the same as the $(2n+1)$th bit, for all $n$. This will fail to be $P$-random.


