Buscar
Mostrando ítems 11-20 de 28
Artículo
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
(Hindawi/Wiley, 2017)
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ...
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
Razonamiento explicativo y evolución de lógicas: Una aproximación desde la semántica de mundos posibles
(Universidad de Málaga, 2013)
Realizamos un acercamiento al razonamiento explicativo mediante estructuras modales. Usamos el formalismo bien conocido de los marcos de Kripke, pero asociamos a cada mundo, no una interpretación, sino una lógica. De este ...
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 ...
Artículo
Internet y la difusión del conocimiento libre
(Fundación Emmanuel Mounier, 2012)
Artículo
Abduction for (non-ominiscient) agents
(2010)
Among the non-monotonic reasoning processes, abduction is one of the most important. Usually described as the process of looking florexplantions, it has been recognized as one of the most commonly used in our daily activities. ...
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
(PeerJ, 2015)
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional ...
Artículo
Fractal dimension versus process complexity
(Hindawi Publishing Corporation, 2016)
We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. For any particular such machine t and any particular input x, we consider what we call the space-time ...
Ponencia
Abducción y semántica de teoría de juegos
(Universidade de Santiago de Compostela, Servizo de Publicacións e Intercambio Científico, 2012)
An agency-inspired inferential game is proposed in which two agents (abductive and deductive) interact. It depicts hybrid inferencial contexts where deductive and abductive steps are mixed. The abductive agent can use ...
Capítulo de Libro
Consistencia y relevancia en el razonamiento abductivo
(Fénix Editora, 2010)