Sciweavers

2588 search results - page 5 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 1 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
CCA
2009
Springer
14 years 2 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
17
Voted
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...