Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,360,324 papers from all fields of science
Search
Sign In
Create Free Account
Recursive set
Known as:
Computable set
, Recursively definable
, Decidable set
Expand
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Adian–Rabin theorem
Algorithm
Arithmetical hierarchy
Axiomatic system
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Extending H1-clauses with disequalities
H. Seidl
,
Andreas Reuß
Information Processing Letters
2011
Corpus ID: 37612760
Review
2010
Review
2010
Survey: Tree Transducers in Machine Translation
A. Maletti
Workshop on Non-Classical Models for Automata and…
2010
Corpus ID: 1011554
In this survey, several model of tree transducers are investigated with respect to properties that are relevant in machine…
Expand
2007
2007
Reasoning about Communication Graphs
E. Pacuit
,
R. Parikh
2007
Corpus ID: 14775180
Let us assume that some agents are connected by a communication graph. In the communication graph, an edge from agent i to agent…
Expand
2007
2007
Conjunctive Query Entailment for SHOQ
Birte Glimm
,
Ian Horrocks
,
U. Sattler
Description Logics
2007
Corpus ID: 5773392
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we…
Expand
1997
1997
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers
A. Lisitsa
,
V. Sazonov
Theoretical Computer Science
1997
Corpus ID: 7496901
Review
1995
Review
1995
Aspects of Geometric Mechanics and Control of Mechanical Systems
A. D. Lewis
1995
Corpus ID: 120525256
Many interesting control systems are mechanical control systems. In spite of this, there has not been much effort to develop…
Expand
1994
1994
Negative set constraints with equality
Witold Charatonik
,
L. Pacholski
Proceedings Ninth Annual IEEE Symposium on Logic…
1994
Corpus ID: 18162170
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis…
Expand
1993
1993
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
Jordi Levy
,
J. Agustí-Cullell
International Conference on Rewriting Techniques…
1993
Corpus ID: 14710645
We propose an extension of rewriting techniques to derive inclusion relations \(a \subseteq b\) between terms built from…
Expand
1987
1987
Recursively rigid Boolean algebras
J. Remmel
Annals of Pure and Applied Logic
1987
Corpus ID: 6568588
1986
1986
Floating-point error analysis of recursive least-squares and least-mean-squares adaptive filters
S. Ardalan
1986
Corpus ID: 8577896
A floating-point error analysis of the Recursive LeastSquares (RLS) and Least-Mean-Squares (LMS) algorithms is presented. Both…
Expand
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)
ACCEPT & CONTINUE