R (complexity): Difference between revisions

Revision as of 05:38, 8 November 2005

Revision as of 01:33, 9 November 2005

Line 1:

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 <math>RE \cap coRE</math>.

Equals RE intersect coRE.

==External links==

From* [http://qwiki.caltech.edu/wiki/Complexity_Zoo#re Complexity Zoo]

[[Category:Complexity classes]]