Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

26 relations
Adian–Rabin theoremAlgorithmArithmetical hierarchyAxiomatic system
Expand

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Event-triggered model predictive control of discrete-time linear systems subject to disturbances
This paper presents an approach to event-triggered model predictive control for discrete-time linear systems subject to input and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
It's who you know: graph mining using recursive structural features
Given a graph, how can we extract good features for the nodes? For example, given two large graphs from the same domain, how can… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A logic-based framework for attribute based access control
Attribute based access control (ABAC) grants accesses to services based on the attributes possessed by the requester. Thus, ABAC… Expand
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Reducing Model Checking of the Many to the Few
Systems with an arbitrary number of homogeneous processes occur in many applications. The Parametrized Model Checking Problem… Expand
  • figure 1.1
  • figure 1.2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Robust Undecidability of Timed and Hybrid Systems
The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Handlebody construction of Stein surfaces
The topology of Stein surfaces and contact 3-manifolds is studied by means of handle decompositions. A simple characterization of… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Fusions of Modal Logics Revisited
  • F. Wolter
  • Advances in Modal Logic
  • 1996
    • Corpus ID: 17586054
The fusion Ll Lr of two normal modal logics formulated in languages with disjoint sets of modal operators is the smallest normal… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
On the Consistency of Koomen's Fair Abstraction Rule
Abstract We construct a graph model for ACP τ , the algebra of communicating processes with silent steps, in which Koomen's Fair… Expand
  • figure 2
  • figure 4
  • figure 6
  • figure 11
  • figure 12
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Modeling By Shortest Data Description*
The number of digits it takes to write down an observed sequence x1,...,xN of a time series depends on the model with its… Expand
Is this relevant?
Highly Cited
1959
Highly Cited
1959
Recursive functionals and quantifiers of finite types. II
This is the third of a series of papers in these Transactions on hierarchies obtained by quantifying variables of recursive… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE