In computer - complexity theory , randomized polynomial time ( RP ) is the complexity class of problems for which a probabilistic turing machine exists with these characteristics :
In polynomial complexity theory , randomized computational time ( RP ) is the complexity class of problems for which a probabilistic Turing machine exists with these properties :

Are these two sentences paraphrases of each other?
Possible answers:
--no;
--yes;
no