146 search results - page 11 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
INFORMATICALT
2010
13 years 7 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
TCS
2008
13 years 9 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
DEDS
2008
13 years 10 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
WCC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...