Search: in
R (complexity)
R (complexity) in Encyclopedia Encyclopedia
  Tutorials     Encyclopedia     Videos     Books     Software     DVDs  

R (complexity)

In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages. R is equal to the set of all total computable functions.

Since we can decide any problem for which there exists a recogniser and also a co-recogniser by simply interleaving them until one obtains a result, the class is equal to RE \cap coRE.

External links

es:R (clase de complejidad) ko:R ( ) ja:R ( ) ru: R zh:R ( )

Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article

Search for R (complexity) in Tutorials
Search for R (complexity) in Encyclopedia
Search for R (complexity) in Videos
Search for R (complexity) in Books
Search for R (complexity) in Software
Search for R (complexity) in DVDs
Search for R (complexity) in Store


R (complexity) in Encyclopedia
R_(complexity) top R_(complexity)

Home - Add TutorGig to Your Site - Disclaimer

©2011-2013 All Rights Reserved. Privacy Statement