Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
Adian–Rabin theoremAlgorithmArithmetical hierarchyAxiomatic system

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward
Reasoning with existential rules typically consists of checking whether a Boolean conjunctive query is satisfied by all models of… 
2007
2007
Tribe: More Types for Virtual Classes
Beginning with Beta, a range of programming language mechanisms have been developed to allow inheritance in the presence of… 
2001
2001
Computational depth
Introduces computational depth, a measure for the amount of "non-random" or "useful" information in a string, by considering the… 
1999
1999
Query Containment in the Presence of Limited Access Patterns
  • Chen Li
  • 1999
  • Corpus ID: 18727449
In information-integration systems, sources may have access pattern limitations, i.e., they require values for certain attributes… 
Review
1995
Review
1995
Aspects of Geometric Mechanics and Control of Mechanical Systems
Many interesting control systems are mechanical control systems. In spite of this, there has not been much effort to develop… 
1994
1994
Negative set constraints with equality
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis… 
1993
1993
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations \(a \subseteq b\) between terms built from… 
1992
1992
Eco-problem-solving model (abstract): results of the n-puzzle
Eco-Problem-Solving (EPS) is a new approach to problem solving based on the paradigms of Distributed Artificial Intelligence and… 
1986
1986
Floating-point error analysis of recursive least-squares and least-mean-squares adaptive filters
A floating-point error analysis of the Recursive LeastSquares (RLS) and Least-Mean-Squares (LMS) algorithms is presented. Both… 
Review
1957
Review
1957
Review: H. G. Rice, Recursive and Recursively Enumerable Orders
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)