146 research outputs found

    Overcoming Problems in the Measurement of Biological Complexity

    Full text link
    In a genetic algorithm, fluctuations of the entropy of a genome over time are interpreted as fluctuations of the information that the genome's organism is storing about its environment, being this reflected in more complex organisms. The computation of this entropy presents technical problems due to the small population sizes used in practice. In this work we propose and test an alternative way of measuring the entropy variation in a population by means of algorithmic information theory, where the entropy variation between two generational steps is the Kolmogorov complexity of the first step conditioned to the second one. As an example application of this technique, we report experimental differences in entropy evolution between systems in which sexual reproduction is present or absent.Comment: 4 pages, 5 figure

    The role of oblivion, memory size and spatial separation in dynamic language games

    Full text link
    In this paper we present some multiagent simulations in which the individuals try to reach a uniform vocabulary to name spatial movements. Each agent has initially a random vocabulary that can be modified by means of interactions with the other agents. As the objective is to name movements, the topic of conversation is chosen by moving. Each agent can remember a finite number of words per movement, with certain strength. We show the importance of the forgetting process and memory size in these simulations, discuss the effect of the number of agents on the time to agree and present a few experiments where the evolution of vocabularies takes place in a divided range.This paper has been sponsored by the Spanish Interdepartmental Commission of Science and Technology (CICYT), project numbers TEL1999-0181, and TIC 2001-0685-C02-01

    Some strategies for the simulation of vocabulary agreement in multi-agent communities

    Full text link
    In this paper, we present several experiments of belief propagation in multi-agent communities. Each agent in the simulation has an initial random vocabulary (4 words) corresponding to each possible movement (north, south, east and west). Agents move and communicate the associated word to the surrounding agents, which can be convinced by the 'speaking agent', and change their corresponding word by 'imitation'. Vocabulary uniformity is achieved, but strong interactions and competition can occur between dominant words. Several moving and trusting strategies as well as agent roles are analyzed.This paper has been sponsored by the Spanish Interdepartmental Commission of Science and Technology (CICYT), project number TEL1999-0181

    Automatic solution of sorites

    Full text link
    This article is © Emerald Group Publishing and permission has been granted for this version to appear here http://www.emeraldinsight.com/doi/abs/10.1108/eb005540. Emerald does not grant permission for this article to be further copied/distributed or hosted elsewhere without the express permission from Emerald Group Publishing Limited

    El mito del progreso en la evolución de la ciencia

    Full text link
    Este trabajo recoge el contenido de la Conferencia final del Curso 1997-98 de la U.A.M

    About the Infinite Repetition of Histories in Space

    Get PDF
    This paper analyzes two different proposals, one by Ellis and Brundrit, based on classical relativistic cosmology, the other by Garriga and Vilenkin, based on the DH interpretation of quantum mechanics, both of which conclude that, in an infinite universe, planets and living beings must be repeated an infinite number of times. We point to some possible shortcomings in the arguments of these authors. We conclude that the idea of an infinite repetition of histories in space cannot be considered strictly speaking a consequence of current physics and cosmology. Such ideas should be seen rather as examples of {\guillemotleft}ironic science{\guillemotright} in the terminology of John Horgan.Comment: 14 pages, no figures. Accepted for publication in slightly different form at THEORIA (http://www.ehu.es/ojs/index.php/THEORIA

    Compiling a simulation language in APL

    Full text link
    This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in APL Quote Quad, http://dx.doi.org/10.1145/327600.327625This paper describes the procedure used to build several compilers, written in APL and APL2, to translate two continuous simulation languages into APL and C++. The advantages and disadvantages of using APL to write a compiler are discussed. A compromise had to be found between performance (the model execution speed) and flexibility (the ease to modify parameters and test "what if" situations). The resulting compiler (an APL2 packaged workspace) has been used successfully to generate educational applications and in medical research.This paper has been sponsored by the Spanish Interdepartmental Commission of Science and Technology (CICYT), project number TIC-96-0723-C02-01

    Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems

    Get PDF
    This is the published version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 341, 1–3, (2005) DOI: 10.1016/j.tcs.2005.05.002This paper proves the decidability of several problems in the theory of HD 0L, D0L and PD 0L systems, some of which that have been proved before but are now proved in a different way. First, the paper tackles the decidability of the nilpotency of HD 0L systems and the infinitude of PD 0L languages. Then, we prove the decidability of the problem of momentary stagnation of the growth function of PD 0L systems. Finally, we suggest a way to solve the decidability of the momentary stagnation of the growth function of D0L systems, proving the decidability of the infinitude of HD 0L as a trivial consequence.This paper has been partially sponsored by the UPV/EHU project number 9/upv 00003.230-13707/2001. This paper has been partially sponsored by the Spanish Ministry of Science and Technology (MCYT) project number TIC2002-01948

    A Machine-Independent APL Interpreter

    Full text link
    Available in IEEE Xplore digital library.The problem of writing machine-independent APL interpreters is solved by means of a systems programming approach making use of an intermediate level language specially designed for that purpose. This paper describes the language, as well as the procedure used to build universal interpreters. Three compilers that translate this language for three different machines have been written so far, and an APL interpreter has been finishe

    Book Review: Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language

    Full text link
    The final publication is available at Springer via http://dx.doi.org/10.1023/B:GENP.0000036057.27304.5
    • …
    corecore