<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>anticipatory systems</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=151</link>
    <description>Index terms</description>
    <language>fr</language>
    <ttl>0</ttl>
    <item>
      <title>Locality Weak or Strong Anticipation and Quantum Computing. II. Constructivism with Category Theory</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4546</link>
      <description>The universal Turing machine is an anticipatory theory of computability by any digital or quantum machine. However the Church-Turing hypothesis only gives weak anticipation. The construction of the quantum computer (unlike classical computing) requires theory with strong anticipation. Category theory provides the necessary coordinate-free mathematical language which is both constructive and non-local to subsume the various interpretations of quantum theory in one pullback/pushout Dolittle diagram. This diagrame can be used to test and classify physical devices and proposed algorithms for weak or strong anticipation. Quantum Information Science is more than a merger of Church-Tirring and quantum theories. It has constructively to bridge the non-local chasm between the weak anticipation of mathematics and the strong anticipation of physics , </description>
      <pubDate>Mon, 14 Oct 2024 10:51:06 +0200</pubDate>
      <lastBuildDate>Mon, 14 Oct 2024 12:59:33 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4546</guid>
    </item>
    <item>
      <title>Locality Weak or Strong Anticipation and Quantum Computing. I. Non-locality in Quantum Theory</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4540</link>
      <description>The universal Turing machine is an anticipatory theory of computability by any digital or quantum machine. However the Church-Turing hypothesis only gives weak anticipation. The construction of the quantum computer (unlike classical computing) requires theory with strong anticipation. Category theory provides the necessary coordinate-free mathematical language which is both constructive and non-local to subsume the various interpretations of quantum theory in one pullback/pushout Dolittle diagram. This diagrame can be used to test and classify physical devices and proposed algorithms for weak or strong anticipation. Quantum Information Science is more than a merger of Church-Tirring and quantum theories. It has constructively to bridge the non-local chasm between the weak anticipation of mathematics and the strong anticipation of physics , </description>
      <pubDate>Mon, 14 Oct 2024 10:47:39 +0200</pubDate>
      <lastBuildDate>Mon, 14 Oct 2024 12:58:47 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4540</guid>
    </item>
    <item>
      <title>Generalized Semi-Infinite Optimization and Anticipatory Systems</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=1883</link>
      <description>This article is a small survey and pioneering as a starting point for a longer research project : to utilize generalized semi-infinite optimization for purposes of prediction. Firstly, it reflects tbe analytical and inverse (intrinsic) behaviour of generalized semi-infinite optimization problems P(f,h,g,u,v) and presents interpretations of them from the viewpoint of anticipatory systems. These differentiable problems admit an infinite set Y(x) of inequality constraints y, which depends on the state x. Under suitable assumptions, we present global stability properties of the feasible set and corresponding structural stability properties of the entire optimization problem (Weber, 2002 ; Weber, 2003). The achieved results are a basis of algorithm design.  In the course of explanation, the perturbational approach gives rise to reconstructions. By studying three applications of generalized semi-infinite optimization, secondly, we interpret these aspects of inverse problems in the sense of prediction. The three anticipatory systems are : (i) Reverse Chebycchev approximation, where we describe a given system by a neighbouring easier one as long as possible under some error tolerance. We begin by a motivating problem from chemical engineering and turn then to time-dependent systems. (ii) Time-minimal or -maximal optimization problems, where we want to pull or push the time-horizon of some process to present time or into the future. We mention global warming and turn to further kinds of biosystems. (iii) Computational biology, where we are concerned with prediction and stability of DNA microarray gene-expression patterns. </description>
      <pubDate>Wed, 17 Jul 2024 12:56:01 +0200</pubDate>
      <lastBuildDate>Thu, 10 Oct 2024 16:49:39 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=1883</guid>
    </item>
    <item>
      <title>Composition of Transformations : A Framework for Systems with Dynamic Topology</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=2678</link>
      <description>In graph-based systems there are many methods to compose (possibly different) graphs. However, none of these usual compositions are adequate to naturally express semantics of systems with dynamic topology, i.e., systems whose topology admits successive transformations through its computation. We constructed a categorical semantic domain for graph based systems with dynamic topology using a new way to compose edges of (possible different) graphs. ln this context, sequences of different graphs represent successive transformations of system topology during its computation and the edges composition between those graphs, the semantics of the corresponding dynamic system. Then we show how the proposed approach can be used to give semantics to concurrent anticipatory systems.  </description>
      <pubDate>Fri, 30 Aug 2024 10:23:17 +0200</pubDate>
      <lastBuildDate>Thu, 10 Oct 2024 10:52:38 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=2678</guid>
    </item>
    <item>
      <title>Are There « Sequential Descriptions » in Physical Systems Analogous to DNA Ribbons in Living Cells ?</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=1248</link>
      <description>According to recent developments of arithmetical relaters, the « sequential descriptions » of some physical systems might have some analogy with DNA ribbons in living cells. But such descriptions might have a physical existence only in « space-time-imbrication » reference frames. After recalling several properties of arithmetical relaters, we explain in the framework of this formalism why these descriptions disappear when an arbitrary observer tries to observe them. A stabilized arithmetical relater (AR) expresses in a structural way the adaptation of a natural system to its environment. Underlying ideal structures of the model appear as Lie structures. The coupling between a system and its environment involves a notion of time which usually cannot be reduced to classical Galilean or reh1ti vistic time. It evokes the numbering of successive symbols in a narrative. The structure of this narrative that gives rise to anticipatory aspects is destroyed by an arbitrary observation. A sequential description contains objective and non-objective elements and depends of the level of imbrication. At macroscopic scale, the objective part of a sequential description is extracted by means of a «Peaceable Working Observer». He does not perturb the system because he knows and respects the structure of imbrication. Then, in simple cases, roles of system and observer can be permuted. The displacement of a rudimentary system in two-dimensional space or the non quantum harmonic oscillator are typical examples; these models use degenerate AR's. Surprising results appear when the narrative is dealing with a system moving in three-dimensional physical space: the solution involves either the use of spinors or an algebraic extension of the formalism. However, the notion of «Peaceable Working Observer» is inadequate at the quantum level. We propose to extract objective descriptions by means of a «spinorial pilot» who works at the imbrication level K/2 when the physical system is described at the imbrication level K. This approach is applied to the quantum harmonic oscillator. Our starting point is nilpotent Lie algebra of dimension 3. A rule of recurrence is deduced from the sequential description. This rule is applied at the level K to an arbitrary point of a « linearized » one-dimensional lattice. Different « linearized » states, belonging to the same level K, are associated only to one point. Without additional information, this rule cannot give automatically certain states at other level K' &amp;gt; K. The « non deterministic part » of the spreading of states, deduced from this rule, appears to be a sequential description of the physical interaction. The deterministic part is a discrete approximation of a derivative operator. The whole description may be considered as a discretization of the Schrödinger equation. This conclusion results from a tedious analysis using an extension of Morse-Thue sequences. Bases of the formalism are presented in two books Relateurs arithmétiques, volumes 1 and 2 (Editions Belrepere, 1997). Some details are given in a recent book Objectivite et pilotage spinoriel, (same publisher, 2000, 443 pages). But there is no information in this book about relations between nilpotent Lie algebra and our model of quantum harmonic oscillator, nor is a comparison between non quantum and quantum models. These points are new. Following these results, we suggest an analogy between peculiar sequential descriptions at quantum scale and DNA ribbons in living cells. This other point is new too. However, such a suggestion is deduced from arithmetical relators describing the environment by only one variable. The presence of an arbitrary observer increases the number of environment variables and destroys the imbrication structure. On the contrary, if this imbrication structure is preserved by hard chemical and geometrical constraints and if a peculiar observer respects them too, the « sequential description » might be observed. There is no inconsistency with the results of quantum physics because this peculiar observer can observe only what he knew before. </description>
      <pubDate>Wed, 10 Jul 2024 09:46:00 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 17:20:03 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=1248</guid>
    </item>
    <item>
      <title>Some Transforms for Modelling of Computing Anticipatory Systems</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=882</link>
      <description>In this paper, we introduce and investigate transforms mapping the space of continuous signals into the space of discrete signals. These transforms map the derivative of an arbitrary order into the forward, the backward, and the average difference. The introduced transforms permit to derive discrete modells for continuous time systems described by differential equations. Since a transform mapping the derivatives into the average differences is provided, modeling of continuous time systems by computing anticipatory systems is included. Application of introduced transforms is illustrated by deriving the discrete modells for harmonic oscillators. </description>
      <pubDate>Mon, 01 Jul 2024 14:04:59 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 14:49:23 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=882</guid>
    </item>
    <item>
      <title>Object Oriented Software for Fuzzy Arithmetic</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=2912</link>
      <description>Anticipatory systems can use for its activity not only simulation models but also models based on fuzzy sets mechanism of expressing uncertainty. Fuzzy sets models can be fruitful mainly in solving problems, in which some of the principal sources of uncertainty are nonstatistical in nature. Fuzzy sets are frequently replaced by fuzzy numbers mainly in the engineering applications for much simpler handling. A fuzzy number can be expressed by a number of different forms that are dependent on complex computation that the given forms can bring. There are also a number of described arithmetic approaches for basic fuzzy arithmetic operations. The paper tries to show how object oriented software can be helpful in the implementation of the different methods and different approaches of fuzzy arithmetic. </description>
      <pubDate>Tue, 03 Sep 2024 15:49:57 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 14:00:55 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=2912</guid>
    </item>
    <item>
      <title>Phenomenology of Communication As Anticipatory System</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=962</link>
      <description>The purpose of this paper is first to give a definition of anticipatory systems, then suggest a phenomenological implication of such a system. ln order to do this, the shortcomings of the Western view of knowledge based on Aristotelian and Platonic views which has dominated most of the world historical references, in comparison to Eastern philosophies, are criticized. The recent developments of autopoietic knowing and its influence on a constructivist orientation to knowledge, although significantly improved over the said views of Aristotle and Plato, are also criticized for their shortcomings. This is due to the fact that it only takes into consideration the conscious intentional aspect of human mentality, rather than a holistic view of knowing. It is further suggested that anticipatory systems viewed from the constructivist perspective faces a similar criticism. We therefore propose a phenomenological approach to knowing. In addition we suggest a model, namely mythopoietic communication, which overcomes some of the said criticism addressed at autopoietic knowing. We find no better concepts than information theory, and the phenomenology of communication that have the capability to provide us with this objective. That is, information in its very being, is the constituent of Being, it is inherent in the physical, biological, socio-cultural, as well as spiritual aspect of Being. Furthermore, the unity of Being is a text through which the pattern of behavior of parts and the whole are anticipatory in nature. Mythopoietic communication, our proposed Metaphenomenological model, we suggest is capable of addressing both issues of physicobiological, as well as archetypal meanings and symbolic dimensions of mythology, therefore the knowing of the totality of Being. Our proposed model represents our idea of bringing together all aspects of our world. The conceptual framework of the model consists of following components: the first component is information and communication theory. This theory is based on the concept of entropy that encompasses the opposite forces of nature and their transformation into one another. It deals with physical, and soco-cultural issues, whether they are material, meaning, or symbols. The second component is the phenomenology of communication, whether transcendental or immanent. The third component is autopoiesis dealing with biological entanglement and cybernetic closure. Finally, mythopoietic communication as a composite concept, which deals with the two diverse aspects of Being, namely, physical and biological (which is dealt with autopoieticly), and mythology, with a broad spectrum covering the unmeasureable aspects of human culture, including, meaning, religion, and spirituality.  </description>
      <pubDate>Wed, 03 Jul 2024 15:55:43 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 13:45:33 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=962</guid>
    </item>
    <item>
      <title>Application of Computer Simulation in Service Systems</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=2935</link>
      <description>There is a problem to anticipate organization of services performed by an enterprise to its customer distributed in an array. At one part, the enterprise is interested to employ the minimum workers for that task, while at the other part the customers should be served as soon as possible after they send a message to the enterprise. Simulation of the variants viewed as materially possible, and then choosing the optimal one of them, is a good technique. A system that uses simulation is an anticipatory one and that anticipating the possible variants is also an anticipatory one, thus we meet nesting anticipatory systems. The anticipation of possible variants can be efficiently supported by applying object-oriented programming. That anticipation may pass over the design of one enterprise. The paper describes this technique and some illustrative examples. </description>
      <pubDate>Tue, 03 Sep 2024 15:52:13 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 13:13:20 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=2935</guid>
    </item>
    <item>
      <title>Application of Computer Simulation in Information Systems</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=2921</link>
      <description>The paper concerns a project of implementing an intelligent information system. The intelligence should cover different aspects, namely reactions to some natural language directives and anticipatory self-organizing. At the start phase, programming tools that will be able to cover the simulation models of the design variants are made and tested. They are structured into four main levels, namely (1) that of the world with communication in fuzzy terms, (2) that concerning the world of repeated existence of systems (used for managing a simulation study), (3) that oriented to simulation of information systems ( used for managing individual simulation experiments), and (4) that directed to the anticipatory abilities of the simulated systems. The programming tools are implemented in SIMULA. </description>
      <pubDate>Tue, 03 Sep 2024 15:51:17 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 13:12:34 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=2921</guid>
    </item>
  </channel>
</rss>