Abduction for (non-ominiscient) agents

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. Still, the traditional definitions of an abductive problem and an abductive solution mention only theories and formulas, leaving agency out of the picture. Our work proposes a study of abductive reasoning from an epistemic and dynamic perspective, making special emphasis on non-ideal agents. We begin by exploring what an abductive problema is in terms of an agent’s information, and what an abductive solution is in terms of the actions that modify it. Then we explore the different kinds of abductive problems and abductive solutions that arise when we consider agents whose information is not closed under logical consequence, and agents whose reasoning abilities are not complete

A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences

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 entropy estimations, here we explore an alternative and complementary approach. We study formal properties of a Levin-inspired measure $m$ calculated from the output distribution of small Turing machines. We introduce and justify finite approximations $m_k$ that have been used in some applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity. We provide proofs of the relevant properties of both $m$ and $m_k$ and compare them to Levin's Universal Distribution. We provide error estimations of $m_k$ with respect to $m$. Finally, we present an application to integer sequences from the Online Encyclopedia of Integer Sequences which suggests that our AP-based measures may characterize non-statistical patterns, and we report interesting correlations with textual, function and program description lengths of the said sequences.Comment: As accepted by the journal Complexity (Wiley/Hindawi

Mística del Logos y contemplación del Padre en Orígenes. Aproximaciones desde el comentario a Juan

The article explores critical elements to understand how Origen elaborates his mystical theology in his Commentary on John. The spiritual progress process implies that rational beings are guided, by God’s Logos, from the practical life to the theoretical one becoming son or daughter of God, in the likeness of the Logos. This process aims at knowing the Father as he is known by the Logos. The article has two parts: 1. The Father’s presence, through the Logos, in rational beings, and 2. a brief characterisation of the salvation, particularly in the perspective of the mediation by the Son of God

Natural scene statistics mediate the perception of image complexity

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 occurring patterns. However, the possible mediational role of natural frequencies in the perception of algorithmic complexity remains unclear. Here we reanalyze Hsu et al. (2010) through a mediational analysis, and complement their results in a new experiment. We conclude that human perception of complexity seems partly shaped by natural scenes statistics, thereby establishing a link between the perception of complexity and the effect of natural scene statistics

Empirical Encounters with Computational Irreducibility and Unpredictability

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines. We present the results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (all 3 and 4 state, 2 symbol) by means of integer sequence prediction using a specialized function finder program. This massive experiment prompts an investigation into rates of convergence of decision procedures and the decidability of sets in addition to a discussion of the (un)predictability of deterministic computing systems in practice. We think this investigation constitutes a novel approach to the discussion of an epistemological question in the context of a computer simulation, and thus represents an interesting exploration at the boundary between philosophical concerns and computational experiments.Comment: 18 pages, 4 figure

Infringements of copyright in Mexico in relation to the digital environment

Con el presente trabajo presentamos al lector una visión panorámica del sistema de protección de los Derechos de Autor en México con relación al entorno digital, para ello iniciamos con una breve revisión a los conceptos fundamentales del Derecho Intelectual, los Derechos de Autor, los Derechos Morales, los Derechos Patrimoniales, su naturaleza jurídica, su regulación en la Ley Federal del Derecho de Autor, el concepto de infracción, clases de infracciones, la legislación aplicable, las autoridades competentes, las infracciones en materia de derecho de autor y sus sanciones, las infracciones en materia de comercio y sus sanciones, la reparación del daño administrativa, el procedimiento administrativo, los delitos en materia de derechos de autor, la reparación del daño penal, tesis jurisprudencial relevante y una serie de conclusiones.With this work we present the reader with a panoramic view of the copyright protection system in Mexico in relation to the digital environment. We begin with a brief review of the fundamental concepts of Intellectual Law, Copyright, Moral Rights, the Patrimonial Rights, its juridical nature, and then, we focus on its regulation in the Federal Copyright Law, the concept of infringement, classes of infractions, the applicable legislation, the competent authorities, the infractions in the matter of copyright and its sanctions, the infringements in matters of commerce and their sanctions, the repair of administrative damage, the administrative procedure, the crimes in the matter of copyright, the reparation of the criminal damage, relevant jurisprudential thesis and a series of conclusions

Informational structures and informational fields as a prototype for the description of postulates of the integrated information theory

Informational Structures (IS) and Informational Fields (IF) have been recently introduced to deal with a continuous dynamical systems-based approach to Integrated Information Theory (IIT). IS and IF contain all the geometrical and topological constraints in the phase space. This allows one to characterize all the past and future dynamical scenarios for a system in any particular state. In this paper, we develop further steps in this direction, describing a proper continuous framework for an abstract formulation, which could serve as a prototype of the IIT postulates.National Science Center of PolandUMO-2016/22/A/ST1/00077Junta de AndalucíaMinisterio de Economia, Industria y Competitividad (MINECO). Españ