A set of axioms for computability

92 Views Asked by At

Is there a paper or text that characterizes the set of computable languages on an alphabet by means of axioms? For instance, such a paper could say that a family of languages is computable if it contains all finite languages, and plus some more axioms. Is there such a paper?