Sentence 1: In computer - complexity theory , randomized polynomial time ( RP ) is the complexity class of problems for which a probabilistic turing machine exists with these characteristics :
Sentence 2: In polynomial complexity theory , randomized computational time ( RP ) is the complexity class of problems for which a probabilistic Turing machine exists with these properties :
Question: Do Sentence 1 and Sentence 2 express the same meaning? Yes or No?