74 search results - page 4 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contr...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
NDJFL
2010
13 years 2 months ago
2010
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...