Jump to content

R (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Pkirlin (talk | contribs) at 05:36, 8 November 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The class of decision problems solvable by a Turing machine. Often identified with the class of 'effectively computable' functions (the Church-Turing thesis).

Equals RE intersect coRE.

From http://qwiki.caltech.edu/wiki/Complexity_Zoo#re

Retrieved from "https://en.wikipedia.org/w/index.php?title=R_(complexity)&oldid=27694223"