Topic

R.

set of all total computable functions

The journal

The conversation starts in the journal — be the first to post.

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 — set of all total computable functions