Back R (Complexitat) Catalan R (clase de complejidad) Spanish R (מחלקת סיבוכיות) HE R (計算複雑性理論) Japanese R (복잡도) Korean R (complexidade) Portuguese R (сложеност) Serbian R (複雜度) Chinese
In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages (also called decidable languages).