R is equal to the set of all total computable functions.
Relationship with other classesEdit
- Blum, Lenore, Mike Shub, and Steve Smale. "On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines." Bulletin (New Series) of the American Mathematical Society 21.1 (1989): 1-46.
|P ≟ NP||This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.|