OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
32
)
Recursively enumerable language
tags:
Chomsky hierarchy
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:
cs.stackexchange.com/questions/52503/non-recursively-enumerable-languages
Table of contents
RE
RE (complexity)
Recursively enumerable language
Tagged
Recursive language
Ancestors
Formal language theory
Computer science
Computer
Information technology
Area of technology
Technology
Index
Incoming links
Recursive language
Undecidable problem
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source