This article explores the usefulness of interdisciplinarity as method of enquiry by proposing an investigation of the concept of information in the light of semiotics. This is because, as Kull, Deacon, Emmeche, Hoffmeyer and Stjernfelt state, information is an implicitly semiotic term (Biological Theory 4(2):167–173, 2009: 169), but the logical relation between semiosis and information has not been sufficiently clarified yet. Across the history of cybernetics, the concept of information undergoes an uneven development; that is, information is an ‘objective’ entity (...) in first order cybernetics, and becomes a ‘subjective’ entity in second order cybernetics. This contradiction relegates the status of information to that of a ‘true’ or ‘false’ formal logic problem. The present study proposes that a solution to this contradiction can be found in Deely’s reconfiguration of Peirce’s ‘object’ (as found in his triadic model of semiosis) into ‘thing’ and ‘object’ (Deely 1981). This ontology allows one to argue that information is neither ‘true’ nor ‘false’, and to suggest that, when considered in light of its workability, information can be both true and false, and as such it constitutes an organism’s purely objective reality (Deely 2009b). It is stated that in the process of building such a reality, information is ‘motivated’ by environmental, physiological, emotional (including past feelings and expectations) constraints which are, in turn, framed by observership. Information is therefore found in the irreducible cybersemiotic process that links at once all these conditions and that is simultaneously constrained by them. The integration of cybernetics’ and semiotics’ understanding of information shows that history is the analytical principle that grants scientific rigour to interdisciplinary investigations. As such, in any attempt to clarify its epistemological stance (e.g. the semiotic aspect of information), it is argued that biosemiotics does not need only to acknowledge semiotics (as it does), but also cybernetics in its interdisciplinary heritage. (shrink)

A Computable Universe is a collection of papers discussing computation in nature and the nature of computation, a compilation of the views of the pioneers in the contemporary area of intellectual inquiry focused on computational and informational theories of the world. This volume is the definitive source of informational/computational views of the world, and of cutting-edge models of the universe, both digital and quantum, discussed from a philosophical perspective as well as in the greatest technical detail. The book discusses the (...) foundations of computation in relation to nature. It focuses on two main questions: What is computation? How does nature compute? The contributors are world-renowned experts who have helped shape a cutting-edge computational understanding of the universe. They discuss computation in the world from a variety of perspectives, ranging from foundational concepts to pragmatic models to ontological conceptions and their philosophical implications. The volume provides a state-of-the-art collection of technical papers and non-technical essays representing a field that takes information and computation to be key to understanding and explaining the basic structure underpinning physical reality. It also includes a new edition of Konrad Zuse's "Calculating Space", and a panel discussion transcription on the topic, featuring worldwide experts (including a Nobel prize) in quantum mechanics, physics, cognition, computation and algorithmic complexity.A Computable Universe is a collection of papers discussing computation in nature and the nature of computation, a compilation of the views of the pioneers in the contemporary area of intellectual inquiry focused on computational and informational theories of the world. This volume is the definitive source of informational/computational views of the world, and of cutting-edge models of the universe, both digital and quantum, discussed from a philosophical perspective as well as in the greatest technical detail. The book discusses the foundations of computation in relation to nature. It focuses on two main questions: What is computation? How does nature compute? The contributors are world-renowned experts who have helped shape a cutting-edge computational understanding of the universe. They discuss computation in the world from a variety of perspectives, ranging from foundational concepts to pragmatic models to ontological conceptions and their philosophical implications. The volume provides a state-of-the-art collection of technical papers and non-technical essays representing a field that takes information and computation to be key to understanding and explaining the basic structure underpinning physical reality. It also includes a new edition of Konrad Zuse's "Calculating Space", and a panel discussion transcription on the topic, featuring worldwide experts (including a Nobel prize) in quantum mechanics, physics, cognition, computation and algorithmic complexity. (shrink)

The internet changes our ways of both knowing and thinking. A person who has grown up using the internet, whether for school or simply to play videogames, tends to extend and reproduce the same model of knowing in other instances. The internet replaces a linear and centralized model with a circular and diffused framework for self-learning that presents certain familiar limits: it demands speed or, at least, not pausing. The internet user is omnivorous, in a rush, and develops a memory (...) that is limited to the short term. However, there are some positive aspects of circular learning that should be emphasized: the possibility of constructing personal paths, comparing different opinions, innovating, overcoming old disciplinary divisions, surmounting the drawbacks of linear learning that often lead to uncritical and purely molecular thinking. La Rete modifica sia il modo di conoscere che di pensare. Una mente cresciuta sulla Rete, facendo ricerche per la scuola, o semplicemente giocando, tende a riprodurre anche in altre occasioni lo stesso modello di conoscenza. A un modello lineare la Rete sostituisce un modello circolare e diffuso di autoapprendimento che presenta alcuni noti limiti: richiede di correre, o per lo meno richiede di non fermarsi. L’utente della Rete è onnivoro e ha fretta e matura una memoria chiusa nel breve termine. Ci sono tuttavia aspetti positivi dell'apprendimento circolare che vanno sottolineati: la possibilità di costruirsi propri percorsi, sondare diverse opinioni, innovare, superare vecchie partizioni disciplinari, superando i difetti dell'apprendimento lineare che molto spesso induce a un pensiero acritico e premente molecolare. (shrink)

Introduction : the computer as a mode of mediation -- The unworkable interface -- Software and ideology -- Are some things unrepresentable? -- Disingenuous informatics -- Postscript : we are the gold farmers.

We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. To this end statistical comparisons are undertaken of the frequency distributions of data from physical sources--repositories of information such as images, data stored in a hard drive, computer programs and DNA sequences--and the output frequency distributions generated by purely algorithmic means--by running abstract (...) computing devices such as Turing machines, cellular automata and Post Tag systems. Statistical correlations were found and their significance measured. (shrink)

Virtual elements can be found not only in information and computer technologies but in such cultural phenomenon as fairy tale. "Virtual" as a philosophical concept has no any categorical and generally shared definition nowadays. The main properties of a virtual reality are geniture, actuality, autonomy and interactivity. In the fairy tale context we treat virtual as a transformed form, a feature of being artificial and created with the help of imagination, built-on a day-to-day existence, having self-entirety and determinancy and crossing (...) the reality. As a therapeutic implement the fairy tale allows a person to enter a virtual space and to perform a personal conversion which is transmitted from a fairy tale’s virtual world to a real world of a man consciousness. (shrink)

The promised open space of cyber-interaction has its dark side hidden behind its brilliant rhetoric. The danger emerges within the very center of developing this technology (cyber-evolution). That is a more fundamental danger than this dark side seems to have. The possible replacement of our primary reality with virtual reality might erode the significance of our existential reality. This means also that the virtual reality might lose its own ground to be constructed. In order to clarify this fundamental problem at (...) issue I show some results from a questionnaire done on younger generation. The results seem to suggest possible way of facing this problem. (shrink)

In this paper, the spirit of human was discovered to be a kind of system to process information which is obedient to the life’s oriented. It emanates from body but surpasses body, they can work together harmoniously, and grow up jointly. Just like the hardware and the software of the computer, our physical body corresponds to the hardware, our spirit corresponds to the software. This software system is far from nothing, it has specific structure system and runningmechanism, it exists in (...) the form of information, and its function is obvious. (shrink)

This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents Experimental Algorithmic Theory as Algorithmic Information Theory and NKS, put together in a mixer. Algorithmic Complexity Theory defines the algorithmic complexity k(s) as the length of the shortest program that produces s. But since finding this short program is in general an undecidable question, the only way to approach k(s) is to use compression algorithms. He shows how to use the Compress function in Mathematica to (...) give an idea about the compressibility of various sequences. However, the idea of applying a compression algorithm breaks down for very short sequences. This is true not only for the Compress function, but also for any other compression algorithm. Zenil's approach is to construct a metric of algorithmic complexity for short sequences from scratch. He defines the algorithmic probability as the probability that an arbitrary program produces a sequence. The basic idea is to run a whole class of computational devices such as Turing Machines or Cellular Automata, and compute the distributions of the sequences they generate. Zenil presents a comparison of frequency distributions of sequences generated by 2-state 3-color Turing Machines and 2-color radius 1 Cellular Automata. He also compared these distributions to distributions found in data from the real world, and found that not only there is correlation across different systems, but also that the distributions are rather stable, and the difference between the distributions in abstract systems and real-world data can be attributed to noise. In his paper Zenil elaborates on the nature of the noise he has encountered. Zenil conjectures that the correlation distances between different systems decreases with a larger number of steps, and converge in the infinite limit case. (shrink)

There are currently considerable confusion and disarray about just how we should view computationalism, connectionism and dynamicism as explanatory frameworks in cognitive science. A key source of this ongoing conflict among the central paradigms in cognitive science is an equivocation on the notion of computation simpliciter. ‘Computation’ is construed differently by computationalism, connectionism, dynamicism and computational neuroscience. I claim that these central paradigms, properly understood, can contribute to an integrated cognitive science. Yet, before this claim can be defended, a better (...) understanding of ‘computation’ is required. ‘Digital computation’ is an ambiguous concept. It is not just the classical dichotomy between analogue and digital computation that is the basis for the equivocation on ‘computation’ simpliciter in cognitive science, but also the diversity of extant accounts of digital computation. There are many answers on what it takes for a system to perform digital computation. Answers to this problem range from Turing machine computation, through the formal manipulation of symbols, the execution of algorithms and others, to the strong-pancomputational thesis, according to which every physical system computes every Turing-computable function. Despite some overlap among them, extant accounts of concrete digital computation are non-equivalent, thus, rendering ‘digital computation’ ambiguous. The objective of this dissertation is twofold. First, it is to promote a clearer understanding of concrete digital computation. Accordingly, my main thesis is that not only are extant accounts of concrete digital computation non-equivalent, but most of them are inadequate. I show that these accounts are not just intensionally different (this is quite trivially the case), but also extensionally distinct. In the course of examining several key accounts of concrete digital computation, I propose the instructional information processing account, according to which digital computation is the processing of discrete data in accordance with finite instructional information. The second objective is to establish the foundational role of computation in cognitive science whilst rejecting the purported representational nature of computation. (shrink)

World semantics for relevant logics include so-called non-normal or impossible worlds providing model-theoretic counterexamples to such irrelevant entailments as (A ∧ ¬A) → B, A → (B∨¬B), or A → (B → B). Some well-known views interpret non-normal worlds as information states. If so, they can plausibly model our ability of conceiving or representing logical impossibilities. The phenomenon is explored by combining a formal setting with philosophical discussion. I take Priest’s basic relevant logic N4 and extend it, on the syntactic (...) side, with a representation operator, (R), and on the semantic side, with particularly anarchic non-normal worlds. This combination easily invalidates unwelcome “logical omniscience” in- ferences of standard epistemic logic, such as belief-consistency and closure under entailment. Some open questions are then raised on the best strategies to regiment (R) in order to express more vertebrate kinds of conceivability. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...) First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer a�rmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for Public Announcement Logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

The article develops a suggestion of how cybersemiotics is pertinent to ecosemiotics. Cybersemiotics uses Luhmann's triadic view of autopoietic systems (biological, psychological, and socio-communicative autopoiesis) and adopts his approach to communication within a biosemiotic framework. The following levels of exosemiosis and signification can be identified under the consideration of nonintentional signs, cybernetics, and information theory: (1) the socio-communicative level of self-conscious signification and language games. (2) the instinctual and species specific level of sign stimuli signifying through innate release response mechanism (...) and sign games, and (3) the level of structural coupling, signal recognition, and languaging, where cybernetic feedback loops evince differences. Signification and communication levels arise whenever autopoietic systems interpenetrate (I) with the language system's semiotic and the psyche's phenosemiotic processes based on imaging, emotion, and volition and (2) between the psyche's phenosemiotic and the body's endosemiotic processes. It is at these two levels that we have the ecosemiotic signification processes of nonintentional signs in nature. Humans are linguistic cyborgs as animals are sign cyborgs because signs at different levels interpenetrate and form our embodied processes. Sign producing and interpreting capability has had selective influence on both animals and humans in evolution. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...) many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) Moore sentence unsuccessful, it is self-refuting, for it never remains true as described. We show that in logics of knowledge and belief for a single agent (extended by S5), Moorean phenomena are the source of all self-refutation; moreover, in logics for an introspective agent (extending KD45), Moorean phenomena are the source of all unsuccessfulness as well. This is a distinctive feature of such logics, for with a non-introspective agent or multiple agents, non-Moorean unsuccessful formulas appear. We also consider how successful and self-refuting formulas relate to the Cartesian and learnable formulas, which have been discussed in connection with Fitch’s “paradox of knowability.” We show that the Cartesian formulas are exactly the formulas that are not eventually self-refuting and that not all learnable formulas are successful. In an appendix, we give syntactic characterizations of the successful and the self-refuting formulas. (shrink)

Currently, the widely used notion of activity is increasingly present in computer science. However, because this notion is used in specific contexts, it becomes vague. Here, the notion of activity is scrutinized in various contexts and, accordingly, put in perspective. It is discussed through four scientific disciplines: computer science, biology, economics, and epistemology. The definition of activity usually used in simulation is extended to new qualitative and quantitative definitions. In computer science, biology and economics disciplines, the new simulation activity definition (...) is first applied critically. Then, activity is discussed generally. In epistemology, activity is discussed, in a prospective way, as a possible framework in models of human beliefs and knowledge. (shrink)

As brightly shown by Mainzer [24], the science of complexity has many distinct origins in many disciplines. Those various origins has led to “an interdisciplinary methodology to explain the emergence of certain macroscopic phenomena via the nonlinear interactions of microscopic elements” (ibid.). This paper suggests that the parallel and strong expansion of modeling and simulation - especially after the Second World War and the subsequent development of computers - is a rationale which also can be counted as an explanation of (...) this emergence. With the benefit of hindsight, one can find three periods in the methodologies of modeling in the empirical sciences: 1st the simple modeling of the simple, 2nd the simple modeling of the complex, 3rd the complex modeling and simulation of the complex. Our main thesis is that the current spreading (since the 90’s) of complex computer simulations of systems of models (where a simulation is no more a step by step calculus of a unique logico-mathematical model) is another promising dimension of the science of complexity. Following this claim, we propose to distinguish three different types of computer simulations in the context of complex systems’ modeling. Finally, we show that these types of simulations lead to three different types of weak emergence, too. (shrink)

This paper proposes an extensionalist analysis of computer simulations (CSs). It puts the emphasis not on languages nor on models, but on symbols, on their extensions, and on their various ways of referring. It shows that chains of reference of symbols in CSs are multiple and of different kinds. As they are distinct and diverse, these chains enable different kinds of remoteness of reference and different kinds of validation for CSs. Although some methodological papers have already underlined the role of (...) these various relationships of reference in CSs and of cross-validations, this diversity is still overlooked in the epistemological literature on CSs. As a consequence, a particular outcome of this analytical view is an ability to classify existing epistemological theses on CSs according to what their authors choose to select and put at the forefront: either the extensions of symbols, or the symbol-types, or the symbol-tokens, or the internal denotational hierarchies of the CS or the reference of these hierarchies to external denotational hierarchies. Through the adoption of this extensionalist view, it also becomes possible to explain more precisely the reasons why some complete reduction of CSs to classical epistemic paradigms such as “experiment” or “theoretical argument” remains doubtful. On this last point, in particular, this paper is in agreement with what many epistemologists already have acknowledged. (shrink)

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)

First, we describe a psychological experiment in which the participants were asked to determine whether sentences of first-order logic were true or false in finite graphs. Second, we define two proof systems for reasoning about truth and falsity in first-order logic. These proof systems feature explicit models of cognitive resources such as declarative memory, procedural memory, working memory, and sensory memory. Third, we describe a computer program that is used to find the smallest proofs in the aforementioned proof systems when (...) capacity limits are put on the cognitive resources. Finally, we investigate the correlation between a number of mathematical complexity measures defined on graphs and sentences and some psychological complexity measures that were recorded in the experiment. (shrink)

We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof of completeness (...) for the corresponding Hilbert-style axiomatization, but also in the development of a mosaic-based tableau system. We further consider extensions for dealing with the case when interactions between the two dimensions exist, thus covering a wide class of bundled Ockhamist branching-time logics, and present for them some partial results, such as a non-analytic version of the tableau system. (shrink)