Computability is related to the notion of what can be computed by a computer or algorithm. Synonyms for computability include algorithmic computability, effective computability, recursive computability, and theoretical computability. Algorithmic computability refers to the ability of a computer to evaluate an algorithm to solve a problem. Effective computability involves finding a solution to a problem using a sequence of operations that can be defined in a finite number of steps. Recursive computability refers to the ability of a computer to calculate the result of a recursive function. Lastly, theoretical computability is the study of the limitations of what can be computationally solved by computers or algorithms.