go-v.orgcodex
Menu
Page tools

codex · Philosophy

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 (also called decidable languages).

Wikipedia contributors, "R (complexity)", Wikipedia, revision 1342244377, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex