Computability Theory Vs. Abstract Algebra
Here's the dirt on how these objects relate to one another:
The most famous connection between computability theory and abstract algebra is the celebrated Word Problem: in a group generated by certain generators which are constrained by certain relations, determine when two words are the same. Computability theory is used to show that no general algorithm exists to perform this task.