In computer science, R-complexity (or recursive complexity) refers to a specific class of problems and their corresponding complexity measures in the field of computational complexity theory. However, the term "R-complexity" is not universally established and may have different meanings in different contexts. In a more generalized sense, complexity denotes the resources required for the execution of an algorithm, typically in terms of time, space, or other resources.
Articles by others on the same topic
Set of all decision problems solvable by a Turing machine, i.e. that decide if a string belongs to a recursive language.