On Kolmogorov complexity and the costs of carrying out strategies
It is common to model costs of carrying out strategies in games in relation to the complexity, in some sense, of the strategies. We show a particularly general definition of complexity for this purpose, one that subsumes many alternatives as special cases. We explore how this definition can be used...
Formato: | Working paper |
---|---|
Publicado em: |
University of Oxford
2000
|
Registros relacionados
-
On existence and uniqueness of a carrying simplex in Kolmogorov differential systems
por: Hou, Zhanyuan
Publicado em: (2020) -
Second quantized Kolmogorov complexity
por: Rogers, C, et al.
Publicado em: (2008) -
How Incomputable Is Kolmogorov Complexity?
por: Paul M.B. Vitányi
Publicado em: (2020-04-01) -
Topological arguments for Kolmogorov complexity
por: Alexander Shen, et al.
Publicado em: (2012-08-01) -
On existence and uniqueness of a modified carrying simplex for discrete Kolmogorov systems
por: Hou, Zhanyuan
Publicado em: (2021)