FAQ

Recursive set

Known as: Computable set, Recursively definable, Decidable set 
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1957-2018
0102019572017

Related topics

Related topics

23 relations
AlgorithmArithmetical hierarchyAxiomatic systemChurch–Turing thesis
(More)

Broader (1)

Theory of computation

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Recursive set
Algorithm
Effective method
Decision problem
Computable function
Formal language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Cobham recursive set functions
This paper introduces the Cobham Recursive Set Functions (CRSF) as a version of polynomial time computable functions on general… (More)
Is this relevant?
2015
2015
Safe Recursive Set Functions
We introduce the safe recursive set functions based on a Bellantoni-Cook style subclass of the primitive recursive set functions… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
A constraint selection technique for recursive set membership identification
Recursive approximation of the set of feasible parameters is a key problem in set membership identification. In this paper a new… (More)
  • figure 1
  • figure 2
  • table 1
  • table 4
  • figure 3
Is this relevant?
2010
2010
On the Lattice of Recursively Enumerable Sets
This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption
In distributed systems users need to share sensitive objects with others based on the recipients’ ability to satisfy a policy… (More)
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata
Many Microbe Microarrays Database (M3D) is designed to facilitate the analysis and visualization of expression data in compendia… (More)
  • figure 1
  • figure 2
Is this relevant?
2002
2002
Random Numbers and an Incomplete Immune Recursive Set
Generalizing the notion of a recursively enumerable (r.e.) set to sets of real numbers and other metric spaces is an important… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Handlebody Construction of Stein Surfaces
  • Robert E. Gompf
  • 1998
The topology of Stein surfaces and contact 3-manifolds is studied by means of handle decompositions. A simple characterization of… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
1997
1997
Nonmonotonic rule systems with recursive sets of restraints
Abstract We study nonmonotonic rule systems with rules that admit infinitely many restraints. We concentrate on the case when the… (More)
Is this relevant?
1997
1997
Low-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning
We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of… (More)
  • figure 2
Is this relevant?