Public Health Agency and R (complexity): Difference between pages
(Difference between pages)
Content deleted Content added
No edit summary |
mNo edit summary |
||
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>.
==External links==
* [http://qwiki.caltech.edu/wiki/Complexity_Zoo#re Complexity Zoo]
[[Category:Complexity classes]]
{{ComplexityClasses}}
|