Ciro Santilli
🔗
Recursively enumerable language
|
🗖 nosplit
|
↑ parent "Formal language theory"
|
30
,
1
,
30
🗖 nosplit
|
⇓ toc
|
↑ parent "Formal language theory"
|
Wikipedia
|
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.
🔗
Non-examples:
https://cs.stackexchange.com/questions/52503/non-recursively-enumerable-languages
🔗
Table of contents
|
30
,
1
,
30
1. RE (complexity)
|
🔗 link
|
🗖 nosplit
|
↑ parent "Recursively enumerable language"
🔗
Incoming links
Recursive language
Undecidable problem