Functions are relations but all relations may not be functions.Can there be an algorithm for a relation which is not a function?What has theory of computation got to say about relations in general.
Can there be an algorithm for a relation which is not a function?
computability;automata