7,369 research outputs found
Artificial life meets computational creativity?
I review the history of work in Artificial Life on the problem of the open-ended evolutionary growth of complexity in computational worlds. This is then put into the context of evolutionary epistemology and human creativity
Are complex systems hard to evolve?
Evolutionary complexity is here measured by the number of trials/evaluations
needed for evolving a logical gate in a non-linear medium. Behavioural
complexity of the gates evolved is characterised in terms of cellular automata
behaviour. We speculate that hierarchies of behavioural and evolutionary
complexities are isomorphic up to some degree, subject to substrate specificity
of evolution and the spectrum of evolution parameters
A Review on the Application of Natural Computing in Environmental Informatics
Natural computing offers new opportunities to understand, model and analyze
the complexity of the physical and human-created environment. This paper
examines the application of natural computing in environmental informatics, by
investigating related work in this research field. Various nature-inspired
techniques are presented, which have been employed to solve different relevant
problems. Advantages and disadvantages of these techniques are discussed,
together with analysis of how natural computing is generally used in
environmental research.Comment: Proc. of EnviroInfo 201
An evolutionary approach to the identification of Cellular Automata based on partial observations
In this paper we consider the identification problem of Cellular Automata
(CAs). The problem is defined and solved in the context of partial observations
with time gaps of unknown length, i.e. pre-recorded, partial configurations of
the system at certain, unknown time steps. A solution method based on a
modified variant of a Genetic Algorithm (GA) is proposed and illustrated with
brief experimental results.Comment: IEEE CEC 201
Complex Systems: A Survey
A complex system is a system composed of many interacting parts, often called
agents, which displays collective behavior that does not follow trivially from
the behaviors of the individual parts. Examples include condensed matter
systems, ecosystems, stock markets and economies, biological evolution, and
indeed the whole of human society. Substantial progress has been made in the
quantitative understanding of complex systems, particularly since the 1980s,
using a combination of basic theory, much of it derived from physics, and
computer simulation. The subject is a broad one, drawing on techniques and
ideas from a wide range of areas. Here I give a survey of the main themes and
methods of complex systems science and an annotated bibliography of resources,
ranging from classic papers to recent books and reviews.Comment: 10 page
Recommended from our members
Layered cellular automata for pseudorandom number generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used
Recommended from our members
Pseudorandom number generation with self programmable cellular automata
In this paper, we propose a new class of cellular automata â self programming cellular automata (SPCA) with specific application to pseudorandom number generation. By changing a cell's state transition rules in relation to factors such as its neighboring cell's states, behavioral complexity can be increased and utilized. Interplay between the state transition neighborhood and rule selection neighborhood leads to a new composite neighborhood and state transition rule that is the linear combination of two different mappings with different temporal dependencies. It is proved that when the transitional matrices for both the state transition and rule selection neighborhood are non-singular, SPCA will not exhibit non-group behavior. Good performance can be obtained using simple neighborhoods with certain CA length, transition rules etc. Certain configurations of SPCA pass all DIEHARD and ENT tests with an implementation cost lower than current reported work. Output sampling methods are also suggested to improve output efficiency by sampling the outputs of the new rule selection neighborhoods
- âŚ