All Questions
1 question
3
votes
1
answer
293
views
Relationship between P-noncomputable and P-random sets
$P$ means polynomial complexity.
$S_p$ is the class of all $P$_random set, and $S_{pc}$ is the class of all $P$ noncomputable sets, is $S_p \bigcap S_{pc}$ empty? If not empty, any example?
what is ...