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.
2011
2011
Extending H1-clauses with disequalities
Review
2010
Review
2010
Survey: Tree Transducers in Machine Translation
In this survey, several model of tree transducers are investigated with respect to properties that are relevant in machine… 
2007
2007
Reasoning about Communication Graphs
Let us assume that some agents are connected by a communication graph. In the communication graph, an edge from agent i to agent… 
1997
1997
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers
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… 
1995
1995
Basic Puzzle Languages
The emptiness problem for non-overlapping Basic puzzle grammars is shown to be decidable. An alternate proof of the decidability… 
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… 
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… 
Highly Cited
1981
Highly Cited
1981
Recursive isomorphism types of recursive Boolean algebras
A Boolean algebra is recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and… 
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)