74 search results - page 3 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
ENTCS
2002
13 years 5 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
FCS
2009
13 years 3 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
COMBINATORICS
2007
13 years 5 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
APAL
2007
13 years 5 months ago
2007
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
COMAD
2009
13 years 6 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...