Buscar
Mostrando ítems 1-5 de 5
Artículo
El giro dinámico en la epistemología formal: el caso del razonamiento explicativo
(Universidad del País Vasco, 2014)
We explore the possibilities that dynamic epistemic logic offers to model abductive reasoning. We show that many of the problems with formal approaches to abduction based on classical logic can be solved when considering ...
Artículo
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
(Elsevier, 2014)
We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of ...
Artículo
Natural scene statistics mediate the perception of image complexity
(Taylor & Francis, 2014)
Humans are sensitive to complexity and regularity in patterns (Falk & Konold, 1997; Yamada, Kawabe, & Miyazaki, 2013). The subjective perception of pattern complexity is correlated to algorithmic (or Kolmogorov-Chaitin) ...
Artículo
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
(Public Library of Science, 2014)
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of ...
Ponencia