Distributed online evolution: an algebraic problem?

Authors:
Daniel Schreckling;Paolo Dini
Affiliations:
Institute of IT-Security and Security Law, University of Passau, Passau, Germany;Department of Media and Communications, London School of Economics and Political Science, London, United Kingdom
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 14
Cited 0

Topology via logic

Topology via logic
Category theory for computing science

Category theory for computing science
Basic category theory for computer scientists

Basic category theory for computer scientists
The evolution and understanding of hierarchical complexity in biology from an algrbraic perspective

Artificial Life
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
A Category Theoretical Argument against the Possibility of Artificial Life: Robert Rosen's Central Proof Revisited

Artificial Life
Interpreting Rosen

Artificial Life
A Living System Must Have Noncomputable Models

Artificial Life
The Localization Hypothesis and Machines

Artificial Life
Computational Realizations of Living Systems

Artificial Life
Merging Hierarchically-Structured Documents in Workflow Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical coordinate systems for understanding complexity and its evolution, with applications to genetic regulatory networks

Artificial Life
Category theoretical distinction between autopoiesis and (M,R) systems

ECAL'07 Proceedings of the 9th European conference on Advances in artificial life

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary computing in general and distributed online evolutionary computation in particular are hard problems in terms of monitoring, evaluation, generating functionality, and performance. We strive to complement current approaches and develop mechanisms which do not require the ex post effort of controlling the outcome of the computation. Instead, the goal of our research agenda foresees techniques which allow evolutionary and distributed computing to solve the problems above a priori. To support such an intrinsic system we make use of the powerful tool of algebra. Thus, this paper sheds some light on algebraic theories which allow the establishment of strong connections between biological concepts, automata theory, and the algebraic theories associated with them. We compile various contributions from different areas of research of the last few years discussing the algebraisation of biological systems and functions and their relation to automata theory and algebra. We highlight the role of category theory and abstract algebra and outline why these concepts are highly relevant for computational approaches inspired by biological mechanisms.