Journal

Volume 21, Issue 2 (June 30, 2020)

4 articles

• Symbols, Rhythms, and Structural Unpredictability in Physics and Biology
  by John M. Myers, F. Hadi Madjid
  J. CS. 2020, 21(2), 171-192;
  Abstract In engineered communications systems such as the internet, the use of symbols depends on coordinating a rhythm of transmission with a rhythm of reception.  This nexus between symbols and their rhythms remains little explored in biology. By examining rhythms of symbols, we offer a novel path for stud... [Read more].
  Abstract In engineered communications systems such as the internet, the use of symbols depends on coordinating a rhythm of transmission with a rhythm of reception.  This nexus between symbols and their rhythms remains little explored in biology. By examining rhythms of symbols, we offer a novel path for studying livingorganisms.Recognizing that investigations in physics depend on the use of symbols reveals a structure common to investigative behavior, not just by physicists, but at all levels of life from people to bacteria. This structure involves agents employing rhythms of symbols in their actions. In contrast to the use of the term ‘agent’ as programmed in artificial intelligence, we provide for agents that behave unpredictably. We hypothesize that rhythms of symbols are used to construct orienting mechanisms analogous to what physics calls space and time. Agents as here defined come with local clocks that they use and adjust to maintain shared rhythms.By recognizing mutually adjusted local clocks as necessary to the communication of symbols, investigators of neural activity in biological organisms have the opportunity to avoid the laboratory “master clock,” or global time, in thinking about neural activity. Instead they are free to examine how local clocks are involved in the unpredictable formation and dissolution of rhythms of symbols across the cell assemblies involved in animal navigation. The recognition of local clocking of biological symbols opens to view phenomena not otherwise  visible. [Collapse]
• Comparison of Different Lexical Resources With Respect to the Tip-of-the-Tongue Problem
  by Michael Zock, Chris Biemann
  J. CS. 2020, 21(2), 193-252;
  Abstract Language production is largely a matter of words which, in the case of access problems, can be searched for in an external resource (lexicon, thesaurus). Whenaccessing the resource, the user provides her momentarily available knowledge concerning the target and the resource-powered system responds w... [Read more].
  Abstract Language production is largely a matter of words which, in the case of access problems, can be searched for in an external resource (lexicon, thesaurus). Whenaccessing the resource, the user provides her momentarily available knowledge concerning the target and the resource-powered system responds with the bestguess(es) it can make given this input. As tip-of-the-tongue studies have shown, people always have some knowledge concerning the target (meaning fragments,number of syllables, ...) even if its precise or complete form is eluding them. We will show here how to tap on this knowledge to build a resource likely to helpauthors (speakers/writers) to overcome the Tip-of-the-Tongue (ToT) problem. Yet, before doing so we need a better understanding of the various kinds of knowledge people have when looking for a word. To this end, we asked crowd workers to provide some cues to describe a given target and to specify then how each one of them relates to it, in the hope that this could help others to find the elusive word. Next, we checked how well a given search strategy worked when being applied to differently built lexical networks. The results showed quite dramatic differences, which is not really surprising. After all, different networks are built for different purposes; hence each one of them is more or less well suited for a given task. What was more surprising though is the fact that the relational information given by the users did not allow us to find the elusive word in WordNet more easily than without relying on this information. [Collapse]
• Frustrated Nonphases as Catalysts for Phases - How Graph Theory Calculates Optimal Balance in Linguistic Fibonacci Trees and Gr
  by Koji Arikawa
  J. CS. 2020, 21(2), 253-348;
  Abstract This article examines a graph-theoretical analysis of an externally merged VP as a derivational Fibonacci (F) tree, i.e., a structure written in a Lindenmayer grammar without a linearization condition. We aim to show that the computational procedures of a natural human language (CHL), which is a com... [Read more].
  Abstract This article examines a graph-theoretical analysis of an externally merged VP as a derivational Fibonacci (F) tree, i.e., a structure written in a Lindenmayer grammar without a linearization condition. We aim to show that the computational procedures of a natural human language (CHL), which is a complex system, solve a dynamically frustrated equation (introduced by Philippe Binder, and proposed as a third factor by Juan Uriagereka) in the human brain. The relevant equation is Kirchhoff’s (electric) current law (KCL) AT y = f, which calculates the equilibrium (balance) in any network.Applying the standard graph-theoretical method, we calculate the hidden optimal balance among VP, vP, and CP as an F network. We calculate the potential (cumulative relative quantity of features) in each node and then the current (relative force of feature flow) along each edge.The graph theory shows that an externally merged antisymmetric VP with binary-node connections conceals an extremely symmetric balance (a KCL solution of zero), wherein almost all the edges disappear and the nodes are almost completely disconnected. In this scenario, KCL qualifies as a dynamically frustrated equation caught in a dilemma between two contradictory dynamics: symmetry breaking and symmetry generation.Our challenge is threefold. First, we aim to calculate the optimal balance hidden in sentential F trees. Second, we reassess Richard Kayne’s insightful “connectivity” proposal. Third, we propose a new hypothesis of phase existence. A frustrated nonphase catalyzes the creation of phases, forcing loop structures of feature inheritance and internal merges. These loops are nonzero solutions of the KCL. [Collapse]
• The Problem of Pancomputationalism: Focusing on Three Related Arguments
  by SeongSoo Park
  J. CS. 2020, 21(2), 349-369;
  Abstract Pancomputationalism is the view that everything is a computer. This, if true, poses some difficulties to the computational theory of cognition. In particular, the strongest version of it suggested by John Searle seems enough to trivialize computational cognitivists’ core idea on which our cognitive ... [Read more].
  Abstract Pancomputationalism is the view that everything is a computer. This, if true, poses some difficulties to the computational theory of cognition. In particular, the strongest version of it suggested by John Searle seems enough to trivialize computational cognitivists’ core idea on which our cognitive system is a computing system. The aim of this paper is to argue against Searle’s pancomputationalism. To achieve this, I will draw a line between realized computers and unrealized computers. Through this distinction, I expect that it will become evident that Searle’s pancomputationalism should be understood in terms of unrealized computers, while the computational theory of cognition is concerned with realized computers. [Collapse]