Results 11  20
of
185
Decidability and universality in symbolic dynamical systems
 Fund. Inform
"... Abstract. Many different definitions of computational universality for various types of dynamical systems have flourished since Turing’s work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as un ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Many different definitions of computational universality for various types of dynamical systems have flourished since Turing’s work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as undecidability of a modelchecking problem. For Turing machines, counter machines and tag systems, our definition coincides with the classical one. It yields, however, a new definition for cellular automata and subshifts. Our definition is robust with respect to initial condition, which is a desirable feature for physical realizability. We derive necessary conditions for undecidability and universality. For instance, a universal system must have a sensitive point and a proper subsystem. We conjecture that universal systems have infinite number of subsystems. We also discuss the thesis according to which computation should occur at the ‘edge of chaos ’ and we exhibit a universal chaotic system. 1.
Floridi’s “Open Problems in Philosophy of Information”, Ten Years Later
 INFORMATION
, 2011
"... ..."
A Structurally Dynamic Cellular AutomatonwithMemory
 Chaos, Solitons and Fractals
, 2006
"... The major features of conventional cellular automata include the inalterability of topology and the absence of memory. The effect of simple memory (memory in cells and links) on a particular reversible, structurally dynamic cellular automaton in the triangular tessellation is explored in this paper ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
The major features of conventional cellular automata include the inalterability of topology and the absence of memory. The effect of simple memory (memory in cells and links) on a particular reversible, structurally dynamic cellular automaton in the triangular tessellation is explored in this paper. 1. A triangular cellular automaton Cellular automata (CAs) are discrete, spatially explicit extended dynamic systems. A CA system is composed of adjacent cells or sites arranged as a regular lattice, which evolves in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule involving only the neighborhood of each cell. Thus, if Σ(T)i is taken to denote the value of cell i at time step T, the site values evolve by iteration of the mapping: Σ(T1)i Φ(Σ (T)
LOCAL NESTED STRUCTURE IN RULE 30
"... Abstract. At row 2 n in the cellular automaton rule 30, a region of the initial condition reappears on the right side, which causes the automaton to “begin again ” locally. As a result, local nested structure is produced. This phenomenon is ultimately due to the property that rule 30 is reversible i ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
(Show Context)
Abstract. At row 2 n in the cellular automaton rule 30, a region of the initial condition reappears on the right side, which causes the automaton to “begin again ” locally. As a result, local nested structure is produced. This phenomenon is ultimately due to the property that rule 30 is reversible in time under the condition that the right half of each row is white. The main result of the paper establishes the presence of local nested structure in kcolor rules with this bijectivity property, and we explore a class of integer sequences characterizing the nested structure. We also prove an observation of Wolfram regarding the period length doubling of diagonals on the left side of rule 30. 1.
L.: Immunity through swarms: Agentbased simulations of the human immune system
 In: Artificial Immune Systems, ICARIS 2004, Third International Conference. LNCS 3239
, 2004
"... Abstract. We present a swarmbased, 3dimensional model of the human immune system and its response to first and second viral antigen exposure. Our model utilizes a decentralized swarm approach with multiple agents acting independently—following local interaction rules—to exhibit complex emergent ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present a swarmbased, 3dimensional model of the human immune system and its response to first and second viral antigen exposure. Our model utilizes a decentralized swarm approach with multiple agents acting independently—following local interaction rules—to exhibit complex emergent behaviours, which constitute externally observable and measurable immune reactions. The two main functional branches of the human immune system, humoral and cellmediated immunity, are simulated. We model the production of antibodies in response to a viral population; antibodyantigen complexes are formed, which are removed by macrophages; virally infected cells are lysed by cytotoxic T cells. Our system also demonstrates reinforced reaction to a previously encountered pathogen, thus exhibiting realistic memory response. 1
Coevolving Communication and Cooperation for Lattice formation Tasks
 In Adv. in ALife: Proc. Of 7th European Conf. on ALife
, 2003
"... Abstract. Reactive multiagent systems are shown to coevolve with explicit communication and cooperative behavior to solve lattice formation tasks. Comparable agents that lack the ability to communicate and cooperate are shown to be unsuccessful in solving the same tasks. The control system for thes ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. Reactive multiagent systems are shown to coevolve with explicit communication and cooperative behavior to solve lattice formation tasks. Comparable agents that lack the ability to communicate and cooperate are shown to be unsuccessful in solving the same tasks. The control system for these agents consists of identical cellular automata lookup tables handling communication, cooperation and motion subsystems. 1
Institutionalization through Reciprocal Habitalization and Typification
 Second NASA Workshop on Radical Agent Concepts (WRAC), NASA Goddard Spaceflight
, 2005
"... When constructing multiagent systems, the designer may approach the system as a collection of individuals or may view the entire system as a whole. In addition to these approaches, it may be beneficial to consider the interactions between the individuals and the whole. Borrowing ideas from the notio ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
When constructing multiagent systems, the designer may approach the system as a collection of individuals or may view the entire system as a whole. In addition to these approaches, it may be beneficial to consider the interactions between the individuals and the whole. Borrowing ideas from the notion of social construction and building on previous work in synthetic social construction, this paper presents a framework wherein autonomous agents engage in a dialectic relationship with the society of agents around them. In this framework, agents recognize patterns of social activity in their societies, group such patterns into institutions, and form computational representations of those institutions. The paper presents a design framework describing this method of institutionalization, some implementation suggestions, and a discussion of possible applications.