Ciro Santilli
🔗

Recursively enumerable language | 🗖 nosplit | ↑ parent "Formal language theory" | 30, 1, 30

🔗
There is a Turing machine that halts for every member of the language with the answer yes, but does not necessarily halt for non-members.
🔗
🔗
🔗