Editing RL (complexity) (section)

==Definition==
The probabilistic Turing machines in the definition of '''RL''' never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called ''one-sided error''. The constant 1/3 is arbitrary; any ''x'' with 0 < ''x'' < 1 would suffice. This error can be made 2<sup>−''p''(''x'')</sup> times smaller for any polynomial ''p''(''x'') without using more than polynomial time or logarithmic space by running the algorithm repeatedly.