In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages. ^{[1]}

6 relations: Computable function, Computational complexity theory, Decision problem, Finite-state machine, Recursive language, Turing machine.

Computable functions are the basic objects of study in computability theory.

New!!: R (complexity) and Computable function · See more »

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

New!!: R (complexity) and Computational complexity theory · See more »

In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer, depending on the values of some input parameters.

New!!: R (complexity) and Decision problem · See more »

A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is a mathematical model of computation used to design both computer programs and sequential logic circuits.

New!!: R (complexity) and Finite-state machine · See more »

In mathematics, logic and computer science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language.

New!!: R (complexity) and Recursive language · See more »

A Turing machine is an abstract "machine" that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device.

New!!: R (complexity) and Turing machine · See more »

## Redirects here:

R (complexity class).

## References

[1] https://en.wikipedia.org/wiki/R_(complexity)