scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
22 Aug 1995
TL;DR: This paper gives natural combinatorial characterizations of the fundamental inclusion problem, namely the question for which choices of the parameters m, n, m′, n′, every (m, n)-recursive set is (m′- n′-recursive).
Abstract: The notion of frequency computation concerns approximative computations of n distinct parallel queries to a set A. A is called (m, n)-recursive if there is an algorithm which answers any n distinct parallel queries to A such that at least m answers are correct. This paper gives natural combinatorial characterizations of the fundamental inclusion problem, namely the question for which choices of the parameters m, n, m′, n′, every (m, n)-recursive set is (m′, n′)-recursive. We also characterize the inclusion problem restricted to recursively enumerable sets and the inclusion problem for the polynomial-time bounded version of frequency computation. Furthermore, using these characterizations we obtain many explicit inclusions and noninclusions.

10 citations

Journal ArticleDOI
TL;DR: This work gives an insightful algorithmic description of this kind of systems, where any recursively enumerable language can be generated using a distributed splicing system with a fixed number of nine test tubes.

10 citations

Journal ArticleDOI
TL;DR: It is shown that any recursively enumerable language can be obtained as the language accepted by a P"p"p automaton modulo a simple computable mapping.

10 citations

Journal ArticleDOI
TL;DR: It is shown that a simultaneous enumeration of the recursively enumerable sets can be achieved by a predicate of the same form.
Abstract: It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ 1 0 -predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.

10 citations

Book ChapterDOI
01 Apr 1996

10 citations

Network Information
Related Topics (5)
Decidability
9.9K papers, 205.1K citations
91% related
Multimodal logic
6.1K papers, 178.8K citations
86% related
Type (model theory)
38.9K papers, 670.5K citations
86% related
Dynamic logic (modal logic)
6.6K papers, 210.3K citations
86% related
Mathematical proof
13.8K papers, 374.4K citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20237
202220
202127
202022
201918
201823