84 search results - page 3 / 17 » Kolmogorov complexity and set theoretical representations of... |
125
Voted
AGI
2011
14 years 4 months ago
2011
We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as ...
111
Voted
TCS
2010
14 years 7 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
87
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
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 ...
124
Voted
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
154
Voted
DATAMINE
2006
15 years 25 days ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...