English, asked by krsanjeev1814, 10 months ago

What is the grammar of recursively enumerable language?

Answers

Answered by Anonymous
31

Answer:

A recursively enumerable language is a formal language for which there exists a Turing machine (or other computable function) that will halt and accept when presented with any string in the language as input but may either halt and reject or loop forever when presented with a string not in the language.

Similar questions