A language is called recursive if it is recognized by a Turing machine. These languages are used in algorithms and automata theory.
A language is called recursive if it is recognized by a Turing machine. These languages are used in algorithms and automata theory.