Topic
Recursively enumerable language
About: Recursively enumerable language is a research topic. Over the lifetime, 1508 publications have been published within this topic receiving 32382 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is shown that the model introduced is complete, being able to generate all recursively enumerable sets of natural numbers, and it is proven that completeness is achievable by using a minimal interaction between blocks.
32 citations
[...]
TL;DR: A way of defining data sets by means of logical connectives, where the internal completeness theorem plays an essential role is described, and three characterization results are proved that clarify the computational powers of three classes of designs.
32 citations
TL;DR: P/O systems are introduced to generate any recursively enumerable language and a class of languages between the context-free and context-sensitive ones is obtained.
32 citations
16 Oct 1978
TL;DR: Functions computed on nondeterministic machines consist of two parts; the halting part which consists of outputs of halting computations, is, as expected, recursively enumerable, and the divergence part, which consist of inputs for which diverging computations are possible, can however be any set in Σ11.
Abstract: Functions computed on nondeterministic machines consist of two parts. The halting part which consists of outputs of halting computations, is, as expected, recursively enumerable. The divergence part, which consists of inputs for which diverging computations are possible, can however be any set in Σ11. Such highly noncomputable sets arise if one admits the "finite delay property". This implies that either we make a significant modification to our notion of "computable" as applied to nondeterministic machine models, or else that we ban the finite delay property for nondeterministic models.
32 citations
32 citations