Zobrazeno 1 - 10
of 175
pro vyhledávání: '"Soler Toscano, Fernando"'
In this paper, we study in detail the structure of the global attractor for the Lotka--Volterra system with a Volterra--Lyapunov stable structural matrix. We consider the invasion graph as recently introduced in [19] and prove that its edges represen
Externí odkaz:
http://arxiv.org/abs/2209.09802
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Soler-Toscano, Fernando
Publikováno v:
Published in M.A. Freund, M. Fernandez de Castro and M. Ruffino (eds.), Logic and Philosophy of Logic. Recent Trends in Latin America and Spain. College Publicacions. Studies in Logic, Vol. 78, 2018, pp. 100-116
It may happen that for a certain abductive problem there are several possible explanations, not all of them mutually compatible. What explanation is selected and which criteria are used to select it? This is the well-known problem of the selection of
Externí odkaz:
http://arxiv.org/abs/1902.05479
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Soler-Toscano, Fernando1 fsoler@us.es
Publikováno v:
Andamios. sep-dic2023, Vol. 20 Issue 53, p205-232. 28p.
Autor:
Zenil, Hector, Hernández-Orozco, Santiago, Kiani, Narsis A., Soler-Toscano, Fernando, Rueda-Toicen, Antonio
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based upon Solomonoff-Levin's theory of algorithmic probabilit
Externí odkaz:
http://arxiv.org/abs/1609.00110
Publikováno v:
Visual Cognition 22 (8), 2014, pages 1084-1091
Humans are sensitive to complexity and regularity in patterns. The subjective perception of pattern complexity is correlated to algorithmic (Kolmogorov-Chaitin) complexity as defined in computer science, but also to the frequency of naturally occurri
Externí odkaz:
http://arxiv.org/abs/1509.03970
Autor:
Fernández-Duque, David, Nepomuceno-Fernández, Ángel, Sarrión-Morrillo, Enrique, Soler-Toscano, Fernando, Velázquez-Quesada, Fernando R.
This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may forget the truth-value of an atomic proposition, to a more general case
Externí odkaz:
http://arxiv.org/abs/1507.01111
Autor:
Soler-Toscano, Fernando, Zenil, Hector
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 ones not different to entrop
Externí odkaz:
http://arxiv.org/abs/1504.06240
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph{coding theorem method} the complexity of strings of length 2-11 can n
Externí odkaz:
http://arxiv.org/abs/1409.4080