In combinatorial algorithms, we focus on graph problems. Recursive function theory is a generalization of computability theory; we are chiefly studying the recursively enumerable degrees.