Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,391,145 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.
2015
2015
Program Synthesis from Axiomatic Proof of Correctness
Charles Volkstorf
arXiv.org
2015
Corpus ID: 21150467
Program Synthesis is the mapping of a specification of what a computer program is supposed to do, into a computer program that…
Expand
2007
2007
Tribe: More Types for Virtual Classes
S. Drossopoulou
,
David G. Clarke
,
J. Noble
,
Tobias Wrigstad
2007
Corpus ID: 12130430
Beginning with Beta, a range of programming language mechanisms have been developed to allow inheritance in the presence of…
Expand
2005
2005
Craig’s Theorem
J. Ketland
2005
Corpus ID: 262703156
2001
2001
Computational depth
L. Antunes
,
L. Fortnow
,
D. van Melkebeeck
Proceedings 16th Annual IEEE Conference on…
2001
Corpus ID: 18014144
Introduces computational depth, a measure for the amount of "non-random" or "useful" information in a string, by considering the…
Expand
Review
2001
Review
2001
Time use and class preformance: the marginal benefit of study time
Jenny L. Balduff
2001
Corpus ID: 59503411
Recursive regression analysis revealed that the amount of time spent studying was positively related to quarter GP A for 80…
Expand
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…
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
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
Review
1957
Review
1957
Review: H. G. Rice, Recursive and Recursively Enumerable Orders
Martin D. Davis
1957
Corpus ID: 117739836