R (complexity)
The class of decision problems solvable by a Turing machine. Often identified with the class of 'effectively computable' functions (the Church-Turing thesis).
Since we can decide any problem for which there exists a recogniser and also a co-recogniser, the class is equal to .
