<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Volume 28</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=101</link>
    <category domain="http://popups.lib.uliege.be/1373-5411/index.php?id=65">Full text issues</category>
    <language>fr</language>
    <pubDate>Mon, 13 May 2024 17:00:38 +0200</pubDate>
    <lastBuildDate>Thu, 26 Sep 2024 11:28:35 +0200</lastBuildDate>
    <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=101</guid>
    <ttl>0</ttl>
    <item>
      <title>On The Halting Problem </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4351</link>
      <description>This paper discusses the presence of undecidable problems in mathematics, with reference to the halting problem for algorithms, the hypergame paradox and the paradox of the well-founded sets. All these results are curiously related to self-reference and the strange loop by which a self-observing system can indicate its own operations to itself. </description>
      <pubDate>Thu, 10 Oct 2024 10:00:14 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4351</guid>
    </item>
    <item>
      <title>Recognising the Infinite Cycle </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4364</link>
      <description>The formulations of the undecidability of the Halting Problem assume that the computing process being observed, the description of which is given on the input of the 'observing' Turing Machine, is the exact copy of the computing process running in the observing Turing Machine itself (Cantor's diagonal argument). By this way an analogue of stationary state in thermodynamic sense or an infinite cycle in computing sense is created, shielding now what is to be possibly discovered - the infinite cycle in the observed computing process for a 'normal' input. This shield is the real result of Cantor's diagonal argument which has been used for solving the Halting Problem. We believe that it is possible to recognize the infinite cycle, but with a time delay or staging in evaluating the trace of the observed computing process. Furthermore, the control unit of any Turing Machine is a finite automaton. Both these facts enable that the Pumping Lemma in the observing Turing Machine is usable and the general configuration types are constructed for the observed Turing Machine. This enables (in finite time) us (the observing Turing Machine) to recognize that the computing process in the observed Turing machine has entered into an infinite cycle. These ideas differ from Cantor's diagonal argument. </description>
      <pubDate>Thu, 10 Oct 2024 10:04:15 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4364</guid>
    </item>
    <item>
      <title>A Transformation Mechanism between Sensory Data and Logical Formulas for Anticipatory Reasoning-Reacting Systems </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4369</link>
      <description>Anticipatory reasoning-reacting systems (ARRSs) were proposed as a new generation of reactive systems. Prediction and decision-making are important facilities of ARRSs. For the facilities, a prediction method and a decision-making method with forward reasoning based on strong relevant logic systems are proposed. On the other hand, practical reactive systems generally get sensory data and own internal status as character strings, but not as logical formulas. To implement facilities of prediction and decision-making based on the proposed methods, a transformation mechanism between observed data and logical formulas is demanded, but such a mechanism has not been proposed until now. This paper presents a transformation mechanism observed data and logical formulas for ARRSs. The mechanism can be applied to any computing anticipatory systems with logic-based reasoning. </description>
      <pubDate>Thu, 10 Oct 2024 10:06:22 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4369</guid>
    </item>
    <item>
      <title>Interactive Vertex Coloring of Polyhedral Graphs </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4373</link>
      <description>The author has developed an interactive learning system of polyhedra, based on graph operations and simulated elasticity potential method, mainly for educational purpose. In this paper, we introduce a learning subsystem of vertex colouring, edge colouring, and face colouring, based on minimum spanning tree and degenerated polyhedron. </description>
      <pubDate>Thu, 10 Oct 2024 10:07:18 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4373</guid>
    </item>
    <item>
      <title>World Model, Predictive Model, and Behavioral Model of an Anticipatory Reasoning-Reacting System for Runway Incursion Prevention </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4379</link>
      <description>An anticipatory reasoning-reacting system anticipates based on anticipatory reasoning, which can draw new, previously unknown and/or unrecognized conclusions about some future event or events whose occurrence and truth are uncertain at the point of time when the reasoning is being performed. To perform anticipatory reasoning, we need to express the real world, predictive laws and behavioural patterns of the target domain as empirical theories represented by logical formulas which called world model, predictive model, and behavioural model correspondingly. However, there is no case to show what these models are and how to construct these models. To this end, this paper proposes a general procedure to construct these models, and presents a case study of runway incursion prevention. Besides, this paper also discusses the evaluation of the models. </description>
      <pubDate>Thu, 10 Oct 2024 10:08:32 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4379</guid>
    </item>
    <item>
      <title>Semantic Segmentation of Hypertext on the Basis of Automata Model </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4384</link>
      <description>This article is about website optimization on the basis of semantic segmentation of its hypertext pages. Automata model for hypertext is introduced to describe hypertext organization of website. According to this model states of automaton correspond to hypertext pages and transitions correspond to hypertext links. Then the algorithm of segmentation for hypertext pages based on calculating automata congruences/tolerances is offered. The segmentation is produced by partitioning of states for some congruence or covering of states for some tolerance. The algorithm work under consideration of degrees for hyperlinks and pages, assigned during statistic supervision for website. To achieve appropriative result the initial automaton is consequently modified by decreasing its connectedness. </description>
      <pubDate>Thu, 10 Oct 2024 10:10:18 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4384</guid>
    </item>
    <item>
      <title>Neural Networks Analysis and Synthesis of the Multidimensional Signals by More-Equal-Less Logic </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4390</link>
      <description>The aim of this paper is to formulate non-formal more-equal-less (M-E-L) logic of the neural networks analysis and synthesis of the multidimensional signals for anticipatory control in living and organized systems. The signals analysis and synthesis structures are necessary for anticipation procedures in the more complex systems decision making. The possibilities of neural nets composed of neurons as the algebraic dot productors of continuously varied impulse frequencies characterized by diode non-linearity {N}, when informational operations of fuzzy logic are performed is analyzed. According to the facts of neurobiological research the neurons are divided into satellite and pyramidal ones, and their functional-static characteristics are presented. The operations performed by satellite neurons are characterized as qualitative (not quantitative) informational estimations &quot;more&quot;, &quot;less&quot;, &quot;equal&quot;, i.e., they function according to more-equal-less (M-E-L) logic. Pyramidal neurons with suppressing entries perform algebraic signal operations and as a result of them the output signals are controlled by means of universal logical function &quot;NON disjunction&quot; (Pierce arrow or Dagger function). It is demonstrated how satellite and pyramidal neurons can be used to synthesize the neural nets functioning in parallel and realizing all logical and elementary algebraic functions as well as to perform the conditional controlled operations of information processing. Such neural nets functioning by principles of M-E-L and suppression logic can perform signals' classification, filtration and other informational procedures by non-quantitative assessment, and their informational possibilities (the amount of qualitative states), depending on the number n of analyzing elements-neurons, are proportional to n! Or even to 2n· n!, i.e., much bigger than the possibilities of traditional informational automats functioning by binary principle. Such neurostructures of analysis by synthesis carries signal-information procedures on the principal-factor components analysis methods. </description>
      <pubDate>Thu, 10 Oct 2024 10:12:59 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4390</guid>
    </item>
    <item>
      <title>Collective Behavior of the Metric-Topological Interaction Model by Using Internal Fluctuations in the Flock </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4395</link>
      <description>There are various views on collective animal behaviour such as birds flocking, fish schooling, and insects marching. Despite neither brain nor central control, they behave as a whole. The relation between parts and whole is needed to attack this problem because the collective behavior emerges through the interplay between individuals and the whole collective. However, the bridge between individuals and whole collective remains an open question. Recently, more accurate analysis of flocking behaviour has become possible. Cavagna and others found that fluctuations in a flock show the sizes of spatial correlations scales linearly with the size of the flock. They called this scale-invariant coherence of fluctuations &quot;scale-free correlation.&quot; We suggest, in this paper, that scale-free correlation fills the gap between individuals' and whole flocks' movement. In a previous study, our model (metric-topological interaction model) succeeded in explaining &quot;scale-free correlation.&quot; In this study, the MTI model shows the self-similarity of internal fluctuations and 1/ƒ fluctuation. We also show that these critical fluctuations in MTI flocks lead to flock dividing. From these results, we discuss the possibility of internal fluctuations that contribute to smooth movement as a whole flock, despite having the risk of collapsing itself. </description>
      <pubDate>Thu, 10 Oct 2024 10:14:02 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4395</guid>
    </item>
    <item>
      <title>Non Verbal Communication Devices and Language Acquisition or Re-acquisition </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4402</link>
      <description>The author is a mathematician, trained in logic and recursion theory. When confronted to the needs of children in special education (behavioural problems, mental retardation, x-fragile syndrome, language disorders) he naturally decided to use logico-mathematical tools with them. He created an adapted methodology to use these tools in a nearly non verbal way. This new approach is called the &quot;Non Verbal Communication Device&quot; approach (NVCD). The purpose of this chapter is to describe and define the NVCD like approaches, the cognitive observations realized with them and then to try to answer the question &quot;Why does it work ?&quot; </description>
      <pubDate>Thu, 10 Oct 2024 10:14:45 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4402</guid>
    </item>
    <item>
      <title>Hyperincursive Cogitata and lncursive Cogitantes </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4406</link>
      <description>Strongly anticipatory systems-that is, systems which use models of themselves for their further development-and which additionally may be able to run hyperincursive routines that is, develop only with reference to their future states cannot exist in res extensa, but can only be envisaged in res cogitans. One needs incursive routines of cogitantes to instantiate these systems. Unlike historical systems (with recursion), these hyper-incursive routines generate redundancies by opening horizons of other possible states. Thus, intentional systems can enrich our perceptions of the cases that have happened to occur. The perspective of hindsight codified at the above-individual level enables us furthermore to intervene technologically. The theory and computation of anticipatory systems have made these loops between supra-individual hyper-incursion, individual incursion (in instantiation), and historical recursion accessible for modelling and empirical investigation. </description>
      <pubDate>Thu, 10 Oct 2024 10:15:30 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4406</guid>
    </item>
    <item>
      <title>Dynamics Underneath Symbols </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4410</link>
      <description>Our cognition is structuring the informational layer, consisting of perception, anticipation, and action, and it should also be sustained on a physical basis. In this paper, we aim to explore the relationship between the informational layer and the physical layer from a dynamical systems point of view. As an example, the fluctuation of choice is investigated by using a simulated agent. By setting a T-maze, the agent should choose one arm of the maze if a corresponding token is presented. We prepared two types of tokens, corresponding to the left and right arm of the maze. After training the network of the agent to successfully choose the corresponding arm, we presented two tokens simultaneously to the agent and observed its behavior. As a result, we found several behaviours, which are difficult to speculate on from a case in which only a single token is presented to the agent. Detailed analyses and the implications of the model are discussed.  </description>
      <pubDate>Thu, 10 Oct 2024 10:16:17 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4410</guid>
    </item>
    <item>
      <title>From Self-Awareness to the Consciousness of the &quot;Speaking Subject&quot; </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4414</link>
      <description>This paper concerns human language, which is linked to the process whereby the human brain developed and adapted to its environment via the body, the senses and the intelligence of the speaking subject. We can say, first, that the subject's unconscious reaction to the impact of a sensory percept, whether complex or not, is emotional stricto sensu and physiological; a statement produced in response to this impact still pertains to feeling. A fundamental point in the problem posed here and one that entails an epistemological revolution is that, in self-awareness, various levels of consciousness come into play. We shall see how these concepts can be organized into a coherent and relevant whole in order to put forward the following hypothesis: the eruption of emotion, strictly speaking, anticipates the production of language. </description>
      <pubDate>Thu, 10 Oct 2024 10:17:32 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4414</guid>
    </item>
    <item>
      <title>On how to Define Anticipation in the Verbal Flow </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4419</link>
      <description>Few studies in French concern anticipation in language, and much of this research draws on computing and its algorithms which are based on the vocabulary of linguistics, using terms such as semantics and grammar. This raises a major problem, however, which is bound to the notion of anticipation, namely that of recursion (the role of the subject's linguistic competence and memory). These two interrelated functions of anticipation and recursion contribute to constructing sequences. However, while we can legitimately speak about sequences and concatenation in computing, this is not possible with respect to language, because language is based on a continuum, a combinatorial structure that is constantly evolving. De facto, language and its production rely on a dynamic and complex cognitive operation, anchored in space, time and the subject's knowledge: the speaking subject has to constantly adapt to this ever-changing space, time and knowledge in the continuous information flow. </description>
      <pubDate>Thu, 10 Oct 2024 10:18:28 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4419</guid>
    </item>
    <item>
      <title>Preface </title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=4362</link>
      <pubDate>Thu, 10 Oct 2024 10:02:32 +0200</pubDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=4362</guid>
    </item>
  </channel>
</rss>