%0 Unpublished Work %D 2019 %T Complejidad Explicada %A Valerie C. Valerio Holguín %A Carlos Gershenson %A José Luis Herrera %A Johann H. Martínez %A Manuel Rueda Santos %A Oliver López Corona %A Guillermo de Anda Jáuregui %A Gerardo Iñiguez %A Alfredo J. Morales Guzmán %A José R. Nicolás Carlock %G eng %U https://complexityexplained.github.io %0 Unpublished Work %D 2019 %T Complexity Explained: A Grassroot Collaborative Initiative to Create a Set of Essential Concepts of Complex Systems. %A Manlio De Domenico %A Chico Camargo %A Carlos Gershenson %A Daniel Goldsmith %A Sabine Jeschonnek %A Lorren Kay %A Stefano Nichele %A José Nicolás %A Thomas Schmickl %A Massimo Stella %A Josh Brandoff %A Ángel José Martínez Salinas %A Hiroki Sayama %X Complexity science, also called complex systems science, studies how a large collection of components – locally interacting with each other at small scales – can spontaneously self-organize to exhibit non-trivial global structures and behaviors at larger scales, often without external intervention, central authorities or leaders. The properties of the collection may not be understood or predicted from the full knowledge of its constituents alone. Such a collection is called a complex system and it requires new mathematical frameworks and scientific methodologies for its investigation. %G eng %U https://complexityexplained.github.io %R 10.17605/OSF.IO/TQGNW %0 Conference Proceedings %B 8 Congreso Internacional en Ciencias del Deporte %D 2019 %T El Síndrome de los Datos Ricos e Información Pobre en Deportes de Competición: Perspectiva desde las Ciencias Computacionales y Ciencia de Datos %A Nelson Fernández %A Martín Zumaya %A Carlos Gershenson %X La gran capacidad existente de capturar datos, conlleva la subsecuente responsabilidad de producir información confiable, verificable y auditable para la toma de decisiones. En el futbol, la existencia de compañías y plataformas con capacidad de medir un sinnúmero de variables de desempeño, ha generado una explosión de datos de difícil interpretación. En este sentido, las dificultades relativas al análisis y visualización de estos datos, ha derivado en el “Síndrome de los datos ricos e información pobre”. En este contexto, esta plática se centra en evaluar las lecciones aprendidas y las perspectivas futuras en el manejo de datos en el futbol, desde una perspectiva computacional y de ciencia de datos. Nuestro enfoque metodológico, parte de la evaluación de los formatos en que se produce los datos y los tipos de reportes generados para distintos tipos de usuarios. Planteamos una forma adecuada de manejar e interpretar múltiples variables con soporte en técnicas de aprendizaje automático, con técnicas de ordenación y clasificación para discriminar los factores y variables que tienen mayor contribución en el juego. Finalmente, brindamos información sobre perspectivas novedosas para el modelado de los eventos espacio-temporales, que tienen lugar en los partidos, como la aplicación desde la ciencia de redes, redes de latencia y modelos de gravitación para el modelado. Nuestra perspectiva computacional y de ciencia de datos brinda la posibilidad de mejores visualizaciones, con el propósito de simplificar el gran número de dimensiones y categorías que se inspeccionan en el futbol. De esta forma, nos enfocamos en las interacciones relevantes del juego, que darían soporte a una mejor toma de decisiones por parte de distintos tipos de usuarios, como jugadores, entrenadores y directivos. %B 8 Congreso Internacional en Ciencias del Deporte %C Pachuca, México %G eng %0 Unpublished Work %D 2019 %T Evasión en IVA: Análisis de redes %A Carlos Gershenson %A Gerardo Iñiguez %A Carlos Pineda %A Rita Guerrero %A Eduardo Islas %A Omar Pineda %A Martín Zumaya %G eng %U http://omawww.sat.gob.mx/gobmxtransparencia/Paginas/documentos/estudio_opiniones/Evasion_en_IVA_Analisis_de_Redes.pdf %0 Journal Article %J Physica A: Statistical Mechanics and its Applications %D 2019 %T Rank-frequency distribution of natural languages: A difference of probabilities approach %A Germinal Cocho %A Rosalío F. Rodríguez %A Sergio Sánchez %A Jorge Flores %A Carlos Pineda %A Carlos Gershenson %K Fokker–Planck equation %K Languages %K Master equation %K Rank dynamics %X In this paper we investigate the time variation of the rank k of words for six Indo-European languages using the Google Books N-gram Dataset. Based on numerical evidence, we regard k as a random variable whose dynamics may be described by a Fokker–Planck equation which we solve analytically. For low ranks the distinct languages behave differently, maybe due to the syntax rules, whereas for k>50 the law of large numbers predominates. We analyze the frequency distribution of words using the data and their adjustment in terms of time-dependent probability density distributions. We find small differences between the data and the fits due to conflicting dynamic mechanisms, but the data show a consistent behavior with our general approach. For the lower ranks the behavior of the data changes among languages presumably, again, due to distinct dynamic mechanisms. We discuss a possible origin of these differences and assess the novel features and limitations of our work. %B Physica A: Statistical Mechanics and its Applications %V 532 %P 121795 %G eng %U https://doi.org/10.1016/j.physa.2019.121795 %R 10.1016/j.physa.2019.121795 %0 Conference Proceedings %B 8 Congreso Internacional en Ciencias del Deporte %D 2019 %T Sistemas con Dinámica Acoplada y Redes de Defensa y Ataque: Representación de las Interacciones en Juegos de Competición %A Nelson Fernández %A Víctor Rivera %A Carlos Gershenson %B 8 Congreso Internacional en Ciencias del Deporte %C Pachuca, México %G eng %0 Conference Paper %B Conference on Complex Systems %D 2018 %T Coupled Dynamical Systems and Defense-Attack Networks: Representation of Soccer Players Interactions %A Nelson Fernández %A Víctor Rivera %A Yesid Madrid %A Guillermo Restrepo %A Wilmer Leal %A Carlos Gershenson %B Conference on Complex Systems %C Thessaloniki, Greece %G eng %0 Unpublished Work %D 2018 %T Information in Science and Buddhist Philosophy: Towards a Non-Materialistic Worldview %A Carlos Gershenson %X Information theory has been developed for seventy years with technological applications that have transformed our societies. The increasing ability to store, transmit, and process information is having a revolutionary impact in most disciplines. The goal of this work is to compare the formal approach to information with Buddhist philosophy. Considering both approaches as compatible and complementary, I argue that information theory can improve our understanding of Buddhist philosophy and vice versa. The resulting synthesis leads to a worldview based on information that overcomes limitations of the currently dominating physics-based worldview. %8 November %G eng %R 10.20944/preprints201812.0042.v1 %0 Conference Paper %B Conference on Complex Systems %D 2018 %T Modeling Systems with Coupled Dynamics (SCDs): A Multi-Agent, Networks, and Game Theory-based Approach %A Nelson Fernández %A Osman Ortega %A Yesid Madrid %A Guillermo Restrepo %A Wilmer Leal %A Carlos Gershenson %B Conference on Complex Systems %C Thessaloniki, Greece %G eng %0 Journal Article %J Future Generation Computer Systems %D 2018 %T Multimodel agent-based simulation environment for mass-gatherings and pedestrian dynamics %A Vladislav Karbovskii %A Daniil Voloshin %A Andrey Karsakov %A Alexey Bezgodov %A Carlos Gershenson %X Abstract The increasing interest in complex phenomena, especially in crowd and pedestrian dynamics, has conditioned the demand not only for more sophisticated autonomous models but also for mechanisms that would bring these models together. This paper presents a multimodel agent-based simulation technique based on the incorporation of multiple modules. Two key principles are presented to guide this integration: a common abstract space where entities of different models interact, and commonly controlled agents–-abstract actors operating in the common space, which can be handled by different agent-based models. In order to test the proposed methodology, we run a set of simulations of cinema building evacuation using the general-purpose {PULSE} simulation environment. In this paper we utilize crowd pressure as a metric to estimate the capacity of different emergent conditions to traumatically affect pedestrians in the crowd. The proposed approach is evaluated through a series of experiments simulating the emergency evacuation from a cinema building to the city streets, where building and street levels are reproduced in heterogeneous models. This approach paves the way for modeling realistic city-wide evacuations. %B Future Generation Computer Systems %V 79 %P 155–165 %8 February %G eng %U http://dx.doi.org/10.1016/j.future.2016.10.002 %R 10.1016/j.future.2016.10.002 %0 Book %B Springer Proceedings in Complexity %D 2018 %T Unifying Themes in Complex Systems IX: Proceedings of the Ninth International Conference on Complex Systems %E Alfredo J. Morales %E Carlos Gershenson %E Dan Braha %E Ali A. Minai %E Yaneer Bar-Yam %B Springer Proceedings in Complexity %I Springer %C Cambridge, MA, USA %G eng %U https://link.springer.com/book/10.1007/978-3-319-96661-8 %0 Book %D 2017 %T Conference on Complex Systems 2017 Abstract Booklet %A Carlos Gershenson %A Jose Luis Mateos %C Cancun, Mexico %G eng %U http://ccs17.unam.mx/booklet.pdf %0 Journal Article %J Open Engineering %D 2017 %T Improving ``tail'' computations in a BOINC-based Desktop Grid %A Kolokoltsev, Yevgeniy %A Evgeny Ivashko %A Carlos Gershenson %B Open Engineering %V 7 %P 371-378 %8 December %G eng %R doi:10.1515/eng-2017-0044 %0 Unpublished Work %D 2016 %T Adaptive Cities: A Cybernetic Perspective on Urban Systems %A Carlos Gershenson %A Paolo Santi %A Carlo Ratti %G eng %U https://arxiv.org/abs/1609.02000 %0 Book Section %B Proceedings of the Artificial Life Conference 2016 %D 2016 %T Complexity and Structural Properties in Scale-free Networks %A Yesid Madrid %A Carlos Gershenson %A Nelson Fernández %X We apply formal information measures of emergence, self-organization and complexity to scale-free random networks, to explore their association with structural indicators of network topology. Results show that the cumulative number of nodes and edges coincides with an increment of the self-organization and relative complexity, and a loss of the emergence and complexity. Our approach shows a complementary way of studying networks in terms of information. %B Proceedings of the Artificial Life Conference 2016 %P 730–731 %G eng %0 Journal Article %J Research in Computing Science %D 2016 %T Exploring Dynamic Environments Using Stochastic Search Strategies %A C. A. Piña-García %A Dongbing Gu %A Carlos Gershenson %A J. Mario Siqueiros-García %A E. Robles-Belmont %B Research in Computing Science %V 121 %P 43–57 %G eng %U http://rcs.cic.ipn.mx/2016_121/Exploring%20Dynamic%20Environments%20Using%20Stochastic%20Search%20Strategies.pdf %0 Book Section %B The Pursuit of Legible Policy: Encouraging Agency and Participation in the Complex Systems of the Contemporary Megalopolis %D 2016 %T Improving Urban Mobility by Understanding Its Complexity %A Carlos Gershenson %B The Pursuit of Legible Policy: Encouraging Agency and Participation in the Complex Systems of the Contemporary Megalopolis %I {Buró–Buró %C Mexico City, Mexico %P 149–151 %G eng %0 Book Section %B Proceedings of the Artificial Life Conference 2016 %D 2016 %T Introduction %A Tom Froese %A J. Mario Siqueiros %A Wendy Aguilar %A Eduardo J. Izquierdo %A Hiroki Sayama %A Carlos Gershenson %B Proceedings of the Artificial Life Conference 2016 %P 3–9 %G eng %0 Journal Article %J Future Generation Computer Systems %D 2016 %T Multimodel agent-based simulation environment for mass-gatherings and pedestrian dynamics %A Vladislav Karbovskii %A Daniil Voloshin %A Andrey Karsakov %A Alexey Bezgodov %A Carlos Gershenson %K Urgent computing %X Abstract The increasing interest in complex phenomena, especially in crowd and pedestrian dynamics, has conditioned the demand not only for more sophisticated autonomous models but also for mechanisms that would bring these models together. This paper presents a multimodel agent-based simulation technique based on the incorporation of multiple modules. Two key principles are presented to guide this integration: a common abstract space where entities of different models interact, and commonly controlled agents–-abstract actors operating in the common space, which can be handled by different agent-based models. In order to test the proposed methodology, we run a set of simulations of cinema building evacuation using the general-purpose \{PULSE\} simulation environment. In this paper we utilize crowd pressure as a metric to estimate the capacity of different emergent conditions to traumatically affect pedestrians in the crowd. The proposed approach is evaluated through a series of experiments simulating the emergency evacuation from a cinema building to the city streets, where building and street levels are reproduced in heterogeneous models. This approach paves the way for modeling realistic city-wide evacuations. %B Future Generation Computer Systems %P - %G eng %U http://dx.doi.org/10.1016/j.future.2016.10.002 %R 10.1016/j.future.2016.10.002 %0 Book Section %B Proceedings of the Artificial Life Conference 2016 %D 2016 %T Performance Metrics of Collective Coordinated Motion in Flocks %A Jorge L. Zapotecatl %A Angélica Muñoz-Meléndez %A Carlos Gershenson %B Proceedings of the Artificial Life Conference 2016 %P 322–329 %G eng %0 Book %B Complex Adaptive Systems %D 2016 %T Proceedings of the Artificial Life Conference 2016 %E Carlos Gershenson %E Tom Froese %E Jesus M. Siqueiros %E Wendy Aguilar %E Eduardo J. Izquierdo %E Hiroki Sayama %X The ALife conferences are the major meeting of the artificial life research community since 1987. For its 15th edition in 2016, it was held in Latin America for the first time, in the Mayan Riviera, Mexico, from July 4 -8. The special them of the conference: How can the synthetic study of living systems contribute to societies: scientifically, technically, and culturally? The goal of the conference theme is to better understand societies with the purpose of using this understanding for a more efficient management and development of social systems. %B Complex Adaptive Systems %I MIT Press %C Cambridge, MA, USA %8 July %@ 9780262339360 %G eng %U https://mitpress.mit.edu/books/proceedings-artificial-life-conference-2016 %0 Book Section %B Intelligent Robots and Systems (IROS), 2016 IEEE/RSJ International Conference on %D 2016 %T Self-organized UAV Traffic in Realistic Environments %A Csaba Virágh %A Máté Nagy %A Carlos Gershenson %A Gábor Vásárhelyi %B Intelligent Robots and Systems (IROS), 2016 IEEE/RSJ International Conference on %I IEEE %C Daejeon, South Korea %P 1645–1652 %G eng %R 10.1109/IROS.2016.7759265 %0 Journal Article %J Applied Network Science %D 2016 %T Towards a Standard Sampling Methodology on Online Social Networks: Collecting Global Trends on Twitter %A C. A. Piña-García %A Carlos Gershenson %A J. Mario Siqueiros-García %B Applied Network Science %V 1 %P 3 %G eng %U http://dx.doi.org/10.1007/s41109-016-0004-1 %R 10.1007/s41109-016-0004-1 %0 Journal Article %J Investigación y Ciencia %D 2015 %T Complejidad, Tecnología y Sociedad %A Carlos Gershenson %B Investigación y Ciencia %V 460 %P 48-54 %8 Enero %G eng %U http://www.investigacionyciencia.es/revistas/investigacion-y-ciencia/numeros/2015/1/complejidad-tecnologa-y-sociedad-12732 %0 Book Section %B Desafíos para la Salud Pública %D 2015 %T Complejidad y medicina: perspectivas para el siglo XXI %A Carlos Gershenson %E Mario César Salinas Carmona %B Desafíos para la Salud Pública %S Hacia dónde va la Ciencia en México %I CONACYT, AMC, CCC %P 101–111 %G eng %U http://www.ccciencias.mx/libroshdvcm/14.pdf %0 Journal Article %J Complexity %D 2015 %T Complexity measurement of natural and artificial languages %A Gerardo Febres %A Klaus Jaffe %A Carlos Gershenson %X We compared entropy for texts written in natural languages (English, Spanish) and artificial languages (computer software) based on a simple expression for the entropy as a function of message length and specific word diversity. Code text written in artificial languages showed higher entropy than text of similar length expressed in natural languages. Spanish texts exhibit more symbolic diversity than English ones. Results showed that algorithms based on complexity measures differentiate artificial from natural languages, and that text analysis based on complexity measures allows the unveiling of important aspects of their nature. We propose specific expressions to examine entropy related aspects of tests and estimate the values of entropy, emergence, self-organization, and complexity based on specific diversity and message length. %B Complexity %V 20 %P 25–48 %8 July/August %G eng %U http://arxiv.org/abs/1311.5427 %R 10.1002/cplx.21529 %0 Book Section %B Complèxica: cervell, societat i llengua des de la transdisciplinarietat %D 2015 %T Enfrentando a la Complejidad: Predecir vs. Adaptar %A Carlos Gershenson %X Una de las presuposiciones de la ciencia desde los tiempos de Galileo, Newton y Laplace ha sido la previsibilidad del mundo. Esta idea ha influido en los modelos cient{íficos y tecnológicos. Sin embargo, en las últimas décadas, el caos y la complejidad han mostrado que no todos los fenómenos son previsibles, aún siendo éstos deterministas. Si el espacio de un problema es previsible, podemos en teor{ía encontrar una solución por optimización. No obstante, si el espacio de un problema no es previsible, o cambia más rápido de lo que podemos optimizarlo, la optimización probablemente nos dará una solución obsoleta. Esto sucede con frecuencia cuando la solución inmediata afecta el espacio del problema mismo. Una alternativa se encuentra en la adaptación. Si dotamos a un sistema de ésta propiedad, éste mismo podrá encontrar nuevas soluciones para situaciones no previstas. %B Complèxica: cervell, societat i llengua des de la transdisciplinarietat %I Universitat de Barcelona %C Barcelona %P 25–38 %G eng %U http://arxiv.org/abs/0905.4908 %& 1 %0 Book Section %B Estado del Arte de la Medicina 2013-2014: Las ciencias de la complejidad y la innovación médica: Aplicaciones %D 2015 %T Hacia un sistema de salud autoorganizante y emergente %A Carlos Gershenson %E Enrique Ruelas Barajas %E Ricardo Mansilla Corona %B Estado del Arte de la Medicina 2013-2014: Las ciencias de la complejidad y la innovación médica: Aplicaciones %I Academia Nacional de Medicina %C Mexico %P 245–254 %G eng %0 Journal Article %J Complexity %D 2015 %T Harnessing the Complexity of Education with Information Technology %A Carlos Gershenson %X Education at all levels is facing several challenges in most countries, such as low quality, high costs, lack of educators, and unsatisfied student demand. Traditional approaches are becoming unable to deliver the required education. Several causes for this inefficiency can be identified. I argue that beyond specific causes, the lack of effective education is related to complexity. However, information technology is helping us overcome this complexity. %B Complexity %V 20 %P 13–16 %8 May/June %G eng %U http://arxiv.org/abs/1402.2827 %R 10.1002/cplx.21536 %0 Book Section %B Handobook on Complexity and Public Policy %D 2015 %T Modelling Complexity for Policy: Opportunities and Challenges %A Bruce Edmonds %A Carlos Gershenson %E Robert Geyer %E Paul Cairney %B Handobook on Complexity and Public Policy %I Edward Elgar %P 205-220 %G eng %& 13 %0 Journal Article %J Kybernetes %D 2015 %T Requisite Variety, Autopoiesis, and Self-organization %A Carlos Gershenson %B Kybernetes %V 44 %P 866–873 %G eng %0 Book Section %B Proceedings of the Second International Conference on Complex Sciences: Theory and Applications {(COMPLEX 2012)} %D 2014 %T Decoding Road Networks into Ancient Routes: The Case of the Aztec Empire in Mexico %A Igor Lugo %A Carlos Gershenson %E Kristin Glass %B Proceedings of the Second International Conference on Complex Sciences: Theory and Applications {(COMPLEX 2012)} %S LNICST %I Springer %C Berlin, Germany %V 126 %P 228–233 %G eng %U http://dx.doi.org/10.1007/978-3-319-03473-7_20 %R 10.1007/978-3-319-03473-7_20 %0 Book Section %B Actualidades en el manejo del dolor y cuidados paliativos %D 2014 %T Dolor, placebos y complejidad %A Carlos Gershenson %A Javier Rosado %E Bistre-Cohén, Sara %B Actualidades en el manejo del dolor y cuidados paliativos %I Editorial Alfil %C Mexico %G eng %& 36 %0 Journal Article %J Constructivist Foundations %D 2014 %T Info-computationalism or Materialism? Neither and Both %A Carlos Gershenson %X The limitations of materialism for studying cognition have motivated alternative epistemologies based on information and computation. I argue that these alternatives are also inherently limited and that these limits can only be overcome by considering materialism, info-computationalism, and cognition at the same time. %B Constructivist Foundations %V 9 %P 241–242 %G eng %U http://www.univie.ac.at/constructivism/journal/9/2/241.gershenson %0 Book Section %B Guided Self-Organization: Inception %D 2014 %T Information Measures of Complexity, Emergence, Self-organization, Homeostasis, and Autopoiesis %A Nelson Fernández %A Carlos Maldonado %A Carlos Gershenson %E Mikhail Prokopenko %X

This chapter reviews measures of emergence, self-organization, complexity, homeostasis, and autopoiesis based on information theory. These measures are derived from proposed axioms and tested in two case studies: random Boolean networks and an Arctic lake ecosystem. Emergence is defined as the information produced by a system or process. Self-organization is defined as the opposite of emergence, while complexity is defined as the balance between emergence and self-organization. Homeostasis reflects the stability of a system. Autopoiesis is defined as the ratio between the complexity of a system and the complexity of its environment. The proposed measures can be applied at different scales, which can be studied with multi-scale profiles.

%B Guided Self-Organization: Inception %I Springer %P 19-51 %G eng %U http://arxiv.org/abs/1304.1842 %0 Journal Article %J Entropy %D 2014 %T Measuring the Complexity of Self-organizing Traffic Lights %A Darío Zubillaga %A Geovany Cruz %A Luis Daniel Aguilar %A Jorge Zapotécatl %A Nelson Fernández %A José Aguilar %A David A. Rosenblueth %A Carlos Gershenson %X We apply measures of complexity, emergence, and self-organization to an urban traffic model for comparing a traditional traffic-light coordination method with a self-organizing method in two scenarios: cyclic boundaries and non-orientable boundaries. We show that the measures are useful to identify and characterize different dynamical phases. It becomes clear that different operation regimes are required for different traffic demands. Thus, not only is traffic a non-stationary problem, requiring controllers to adapt constantly; controllers must also change drastically the complexity of their behavior depending on the demand. Based on our measures and extending Ashby's law of requisite variety, we can say that the self-organizing method achieves an adaptability level comparable to that of a living system. %B Entropy %V 16 %P 2384–2407 %G eng %U http://dx.doi.org/10.3390/e16052384 %R 10.3390/e16052384 %0 Journal Article %J systema: connecting matter, life, culture and technology %D 2014 %T The Past, Present and Future of Cybernetics and Systems Research %A Carlos Gershenson %A Peter Csermely %A Peter Erdi %A Helena Knyazeva %A Alexander Laszlo %X Cybernetics and Systems Research (CSR) were developed in the mid-twentieth century, offering the possibility of describing and comparing different phenomena using the same language. The concepts which originated in CSR have spread to practically all disciplines, many now used within the scientific study of complex systems. CSR has the potential to contribute to the solution of relevant problems, but the path towards this goal is not straightforward. This paper summarizes the ideas presented by the authors during a round table in 2012 on the past, present and future of CSR. %B systema: connecting matter, life, culture and technology %V 1 %P 4–13 %G eng %U http://arxiv.org/abs/1308.6317 %0 Journal Article %J {Llengua, Societat i Comunicació %D 2013 %T ?`{Cómo} hablar de complejidad? %A Carlos Gershenson %X Resum En els últims anys s'ha sentit parlar cada cop més de complexitat. Tot i això, com que hi ha una diversitat creixent de discursos sobre aquest tema, en lloc de generar coneixement, estem generant confusió. En aquest article s'ofereix una perspectiva per parlar clarament sobre complexitat des d'un punt de vista epistemològic. Paraules clau: complexitat, epistemologia, context, emergència Resumen En años recientes hemos escuchado hablar más y más sobre complejidad. Pero pareciera que al haber una diversidad creciente de discursos sobre el tema, en lugar de generar conocimiento estamos generando confusión. En este art{ículo se ofrece una perspectiva para hablar claramente sobre la complejidad desde un punto de vista epistemológico.
Palabras clave: complejidad, epistemolog{ía, contexto, emergencia

Abstract In recent years, we have heard more and more about complexity. However, it seems that given the increasing discourse divergence on this topic, instead of generating knowledge we are generating confusion. This paper offers a perspective to speak clearly about complexity from an epistemological point of view.
Keywords: complexity, epistemology, context, emergence %B {Llengua, Societat i Comunicació %V 11 %P 14–19 %G eng %U http://revistes.ub.edu/index.php/LSC/article/view/5682 %0 Book Section %B Encyclopedia of Philosophy and the Social Sciences %D 2013 %T Complexity %A Carlos Gershenson %E Byron Kaldis %X The term complexity derives etymologically from the Latin plexus, which means interwoven. Intuitively, this implies that something complex is composed by elements that are difficult to separate. This difficulty arises from the relevant interactions that take place between components. This lack of separability is at odds with the classical scientific method - which has been used since the times of Galileo, Newton, Descartes, and Laplace - and has also influenced philosophy and engineering. In recent decades, the scientific study of complexity and complex systems has proposed a paradigm shift in science and philosophy, proposing novel methods that take into account relevant interactions. %B Encyclopedia of Philosophy and the Social Sciences %I SAGE %8 April %G eng %U http://arxiv.org/abs/1109.0214 %0 Book Section %B Complexity Perspectives on Language, Communication and Society %D 2013 %T Facing Complexity: Prediction vs. Adaptation %A Carlos Gershenson %E Massip, A. %E A. Bastardas %X One of the presuppositions of science since the times of Galileo, Newton, Laplace, and Descartes has been the predictability of the world. This idea has strongly influenced scientific and technological models. However, in recent decades, chaos and complexity have shown that not every phenomenon is predictable, even if it is deterministic. If a problem space is predictable, in theory we can find a solution via optimization. Nevertheless, if a problem space is not predictable, or it changes too fast, very probably optimization will offer obsolete solutions. This occurs often when the immediate solution affects the problem itself. An alternative is found in adaptation. An adaptive system will be able to find by itself new solutions for unforeseen situations. %B Complexity Perspectives on Language, Communication and Society %I Springer %C Berlin Heidelberg %P 3-14 %@ 978-3-642-32816-9 %G eng %U http://arxiv.org/abs/1112.3843 %R 10.1007/978-3-642-32817-6 %0 Journal Article %J Foundations of Science %D 2013 %T The Implications of Interactions for Science and Philosophy %A Carlos Gershenson %X Reductionism has dominated science and philosophy for centuries. Complexity has recently shown that interactions–-which reductionism neglects–-are relevant for understanding phenomena. When interactions are considered, reductionism becomes limited in several aspects. In this paper, I argue that interactions imply non-reductionism, non-materialism, non-predictability, non-Platonism, and non-nihilism. As alternatives to each of these, holism, informism, adaptation, contextuality, and meaningfulness are put forward, respectively. A worldview that includes interactions not only describes better our world, but can help to solve many open scientific, philosophical, and social problems caused by implications of reductionism. %B Foundations of Science %V Early View %G eng %U http://arxiv.org/abs/1105.2827 %R 10.1007/s10699-012-9305-8 %0 Journal Article %J Artificial Life %D 2013 %T Living in Living Cities %A Carlos Gershenson %K cities %K Self-organization %K traffic %K transport %X

This paper presents and overview of current and potential applications of living technology to urban problems. Living technology can be described as technology that exhibits the core features of living systems. These features can be useful to solve dynamic problems. In particular, urban problems concerning mobility, logistics, telecommunications, governance, safety, sustainability, and society and culture are presented, while solutions involving living technology are reviewed. A methodology for developing living technology is mentioned, while self-organizing traffic lights are used as a case study of the benefits of urban living technology. Finally, the usefulness of describing cities as living systems is discussed.

%B Artificial Life %V In Press %G eng %U http://arxiv.org/abs/1111.3659 %0 Unpublished Work %D 2013 %T Measuring the Complexity of Ultra-Large-Scale Evolutionary Systems %A Michele Amoretti %A Carlos Gershenson %X Ultra-large scale (ULS) systems are becoming pervasive. They are inherently complex, which makes their design and control a challenge for traditional methods. Here we propose the design and analysis of ULS systems using measures of complexity, emergence, self-organization, and homeostasis based on information theory. We evaluate the proposal with a ULS computing system provided with genetic adaptation mechanisms. We show the evolution of the system with stable and also changing workload, using different fitness functions. When the adaptive plan forces the system to converge to a predefined performance level, the nodes may result in highly unstable configurations, that correspond to a high variance in time of the measured complexity. Conversely, if the adaptive plan is less "aggressive", the system may be more stable, but the optimal performance may not be achieved. %G eng %U http://arxiv.org/abs/1207.6656 %0 Journal Article %J Cirug{\'ıa y Cirujanos %D 2013 %T Previniendo enfermedades crónico-degenerativas con vacunas sociales %A Carlos Gershenson %A Thomas Wisdom %B Cirug{\'ıa y Cirujanos %V 81 %P 83-84 %G eng %U http://tinyurl.com/cdswlx5 %0 Journal Article %J Kybernetes %D 2012 %T Adaptive self-organization vs. static optimization: A qualitative comparison in traffic light coordination %A Carlos Gershenson %A David A. Rosenblueth %X Using a recently proposed model of city traffic based on elementary cellular automata, we compare qualitatively two methods for coordinating traffic lights: a \emph{green-wave} method that tries to optimize phases according to expected flows and a \emph{self-organizing} method that adapts to the current traffic conditions. The \emph{self-organizing} method delivers considerable improvements over the \emph{green-wave} method. Seven dynamical regimes and six phase transitions are identified and analyzed for the \emph{self-organizing} method. For low densities, the \emph{self-organizing} method promotes the formation and coordination of platoons that flow freely in four directions, i.e.\ with a maximum velocity and no stops. For medium densities, the method allows a constant usage of the intersections, exploiting their maximum flux capacity. For high densities, the method prevents gridlocks and promotes the formation and coordination of ``free-spaces" that flow in the opposite direction of traffic. %B Kybernetes %V 41 %P 386-403 %G eng %U http://dx.doi.org/10.1108/03684921211229479 %R 10.1108/03684921211229479 %0 Journal Article %J Complexity %D 2012 %T Complexity and Information: Measuring Emergence, Self-organization, and Homeostasis at Multiple Scales %A Carlos Gershenson %A Nelson Fernández %X Concepts used in the scientific study of complex systems have become so widespread that their use and abuse has led to ambiguity and confusion in their meaning. In this paper we use information theory to provide abstract and concise measures of complexity, emergence, self-organization, and homeostasis. The purpose is to clarify the meaning of these concepts with the aid of the proposed formal measures. In a simplified version of the measures (focusing on the information produced by a system), emergence becomes the opposite of self-organization, while complexity represents their balance. Homeostasis can be seen as a measure of the stability of the system. We use computational experiments on random Boolean networks and elementary cellular automata to illustrate our measures at multiple scales. %B Complexity %V 18 %P 29-44 %G eng %U http://dx.doi.org/10.1002/cplx.21424 %R 10.1002/cplx.21424 %0 Journal Article %J Theory in Biosciences %D 2012 %T Guiding the Self-organization of Random Boolean Networks %A Carlos Gershenson %X Random Boolean networks (RBNs) are models of genetic regulatory networks. It is useful to describe RBNs as self-organizing systems to study how changes in the nodes and connections affect the global network dynamics. This article reviews eight different methods for guiding the self-organization of RBNs. In particular, the article is focussed on guiding RBNs towards the critical dynamical regime, which is near the phase transition between the ordered and dynamical phases. The properties and advantages of the critical regime for life, computation, adaptability, evolvability, and robustness are reviewed. The guidance methods of RBNs can be used for engineering systems with the features of the critical regime, as well as for studying how natural selection evolved living systems, which are also critical. %B Theory in Biosciences %V 131 %P 181-191 %8 September %G eng %U http://arxiv.org/abs/1005.5733 %R 10.1007/s12064-011-0144-x %0 Book Section %B How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings %D 2012 %T Learning, Social Intelligence and the {Turing} Test - why an ``out-of-the-box" {Turing} Machine will not pass the {Turing} Test. %A Bruce Edmonds %A Carlos Gershenson %E S. Barry Cooper %E Anuj Dawar %E Benedikt Löwe %X The Turing Test (TT) checks for human intelligence, rather than any putative general intelligence. It involves repeated interaction requiring learning in the form of adaption to the human conversation partner. It is a macro-level post-hoc test in contrast to the definition of a Turing Machine (TM), which is a prior micro-level definition. This raises the question of whether learning is just another computational process, i.e. can be implemented as a TM. Here we argue that learning or adaption is fundamentally different from computation, though it does involve processes that can be seen as computations. To illustrate this difference we compare (a) designing a TM and (b) learning a TM, defining them for the purpose of the argument. We show that there is a well-defined sequence of problems which are not effectively designable but are learnable, in the form of the bounded halting problem. Some characteristics of human intelligence are reviewed including it's: interactive nature, learning abilities, imitative tendencies, linguistic ability and context-dependency. A story that explains some of these is the Social Intelligence Hypothesis. If this is broadly correct, this points to the necessity of a considerable period of acculturation (social learning in context) if an artificial intelligence is to pass the TT. Whilst it is always possible to 'compile' the results of learning into a TM, this would not be a designed TM and would not be able to continually adapt (pass future TTs). We conclude three things, namely that: a purely "designed" TM will never pass the TT; that there is no such thing as a general intelligence since it necessary involves learning; and that learning/adaption and computation should be clearly distinguished. %B How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings %S Lecture Notes in Computer Science %I Springer-Verlag %C Berlin Heidelberg %V 7318/2012 %P 182–192 %G eng %U http://arxiv.org/abs/1203.3376 %R 10.1007/978-3-642-30870-3_18 %0 Journal Article %J Intel Technology Journal %D 2012 %T Self-organizing systems on chip %A Rafael {De La Guardia} %A Carlos Gershenson %X Self-organization in the context of computing systems refers to a technological approach to deal with the increasing complexity associated with the deployment, maintenance, and evolution of such systems. The terms self-organizing and autonomous are often used interchangeably in relation to systems that use organic principles (self-configuration, self-healing, and so on) in their design and operation. In the specific case of system on chip (SoC) design, organic principles are clearly in the solution path for some of the most important challenges in areas like logic organization, data movement, circuits, and software[47]. In this article, we start by providing a definition of the concept of self-organization as it applies to SoCs, explaining what it means and how it may be applied. We then provide a survey of the various recent papers, journal articles, and books on the subject and close by pointing out possible future directions, challenges and opportunities for self-organizing SoCs. %B Intel Technology Journal %V 16 %P 182–201 %G eng %U http://noggin.intel.com/technology-journal/2012/162/exploring-control-and-autonomic-computing %0 Journal Article %J Complexity %D 2012 %T Self-organizing traffic lights at multiple-street intersections %A Carlos Gershenson %A David A. Rosenblueth %X The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. This automaton can therefore model highway traffic. In a recent paper, we have incorporated intersections regulated by traffic lights to this model using exclusively elementary cellular automata. In such a paper, however, we only explored a rectangular grid. We now extend our model to more complex scenarios employing an hexagonal grid. This extension shows first that our model can readily incorporate multiple-way intersections and hence simulate complex scenarios. In addition, the current extension allows us to study and evaluate the behavior of two different kinds of traffic light controller for a grid of six-way streets allowing for either two or three street intersections: a traffic light that tries to adapt to the amount of traffic (which results in self-organizing traffic lights) and a system of synchronized traffic lights with coordinated rigid periods (sometimes called the ``green wave'' method). We observe a tradeoff between system capacity and topological complexity. The green wave method is unable to cope with the complexity of a higher-capacity scenario, while the self-organizing method is scalable, adapting to the complexity of a scenario and exploiting its maximum capacity. Additionally, in this paper we propose a benchmark, independent of methods and models, to measure the performance of a traffic light controller comparing it against a theoretical optimum. %B Complexity %V 17 %P 23-39 %G eng %U http://dx.doi.org/10.1002/cplx.20395 %R 10.1002/cplx.20395 %0 Book Section %B Complexity Theories of Cities Have Come of Age: An Overview with Implications to Urban Planning and Design %D 2012 %T Self-organizing urban transportation systems %A Carlos Gershenson %E Juval Portugali %E Han Meyer %E Egbert Stolk %E Ekim Tan %X Urban transportation is a complex phenomenon. Since many agents are constantly interacting in parallel, it is difficult to predict the future state of a transportation system. Because of this, optimization techniques tend to give obsolete solutions, as the problem changes before it can be optimized. An alternative lies in seeking adaptive solutions. This adaptation can be achieved with self-organization. In a self-organizing transportation system, the elements of the system follow local rules to achieve a global solution. Like this, when the problem changes the system can adapt by itself to the new configuration. In this chapter, I will review recent, current, and future work on self-organizing transportation systems. Self-organizing traffic lights have proven to improve traffic flow considerably over traditional methods. In public transportation systems, simple rules are being explored to prevent the "equal headway instability" phenomenon. The methods we have used can be also applied to other urban transportation systems and their generality is discussed. %B Complexity Theories of Cities Have Come of Age: An Overview with Implications to Urban Planning and Design %I Springer %C Berlin Heidelberg %P 269-279 %G eng %U http://arxiv.org/abs/0912.1588 %R 10.1007/978-3-642-24544-2_15 %0 Conference Paper %B II Simposio Cient{\'ıfico y Tecnológico en Computación SCTC 2012 %D 2012 %T Sistemas Dinámicos como Redes Computacionales de Agentes para la evaluación de sus Propiedades Emergentes. %A Nelson Fernández %A José Aguilar %A Carlos Gershenson %A Oswaldo Terán %B II Simposio Cient{\'ıfico y Tecnológico en Computación SCTC 2012 %C Universidad Central de Venezuela %G eng %0 Book Section %B Unifying Themes in Complex Systems %D 2012 %T The World as Evolving Information %A Carlos Gershenson %E Minai, Ali %E Braha, Dan %E Yaneer {Bar-Yam} %X This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are valid only at the physical scale. However, if matter and energy, as well as life and cognition, are described in terms of information, evolution can be described consistently as information becoming more complex. The paper presents five tentative laws of information, valid at multiple scales, which are generalizations of Darwinian, cybernetic, thermodynamic, and complexity principles. These are further used to discuss the notions of life and cognition and their evolution. %B Unifying Themes in Complex Systems %I Springer %C Berlin Heidelberg %V VII %P 100-115 %G eng %U http://arxiv.org/abs/0704.0304 %R 10.1007/978-3-642-18003-3_10 %0 Journal Article %J Artificial Life %D 2011 %T Complex Networks %A Carlos Gershenson %A Mikhail Prokopenko %X Introduction to the Special Issue on Complex Networks, Artificial Life journal. %B Artificial Life %I MIT Press %V 17 %P 259–261 %8 Fall %G eng %U http://arxiv.org/abs/1104.5538 %R 10.1162/artl_e_00037 %0 Book Section %B Complejidad y Lenguaje %D 2011 %T Enfrentando a la Complejidad: Predecir vs. Adaptar %A Carlos Gershenson %E Martorell, X. %E Massip, A. %X Una de las presuposiciones de la ciencia desde los tiempos de Galileo, Newton y Laplace ha sido la previsibilidad del mundo. Esta idea ha influido en los modelos cient{\'ıficos y tecnológicos. Sin embargo, en las últimas décadas, el caos y la complejidad han mostrado que no todos los fenómenos son previsibles, aún siendo éstos deterministas. Si el espacio de un problema es previsible, podemos en teor{\'ıa encontrar una solución por optimización. No obstante, si el espacio de un problema no es previsible, o cambia más rápido de lo que podemos optimizarlo, la optimización probablemente nos dará una solución obsoleta. Esto sucede con frecuencia cuando la solución inmediata afecta el espacio del problema mismo. Una alternativa se encuentra en la adaptación. Si dotamos a un sistema de ésta propiedad, éste mismo podrá encontrar nuevas soluciones para situaciones no previstas. %B Complejidad y Lenguaje %G eng %U http://arxiv.org/abs/0905.4908 %0 Journal Article %J Cirug{\'ıa y Cirujanos %D 2011 %T Epidemiolog{\'ıa y las Redes Sociales %A Carlos Gershenson %B Cirug{\'ıa y Cirujanos %V 79 %P 199-200 %G eng %U http://tinyurl.com/7nmt3p9 %0 Journal Article %J Complex Systems %D 2011 %T A model of city traffic based on elementary cellular automata %A David A. Rosenblueth %A Carlos Gershenson %X There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. %B Complex Systems %V 19 %P 305-322 %G eng %U http://www.complex-systems.com/pdf/19-4-1.pdf %0 Journal Article %J Artificial Life %D 2011 %T Modular Random {Boolean} Networks %A Rodrigo {Poblanno-Balp} %A Carlos Gershenson %X Random Boolean networks (RBNs) have been a popular model of genetic regulatory networks for more than four decades. However, most RBN studies have been made with random topologies, while real regulatory networks have been found to be modular. In this work, we extend classical RBNs to define modular RBNs. Statistical experiments and analytical results show that modularity has a strong effect on the properties of RBNs. In particular, modular RBNs have more attractors and are closer to criticality when chaotic dynamics would be expected, compared to classical RBNs. %B Artificial Life %I MIT Press %V 17 %P 331–351 %G eng %U http://arxiv.org/abs/1101.1893 %R 10.1162/artl_a_00042 %0 Book Section %B Unifying Themes in Complex Systems %D 2011 %T Protocol Requirements for Self-Organizing Artifacts: Towards an Ambient Intelligence %A Carlos Gershenson %A Francis Heylighen %E Minai, Ali %E Braha, Dan %E Yaneer {Bar-Yam} %X We discuss which properties common-use artifacts should have to collaborate without human intervention. We conceive how devices, such as mobile phones, PDAs, and home appliances, could be seamlessly integrated to provide an "ambient intelligence" that responds to the users desires without requiring explicit programming or commands. While the hardware and software technology to build such systems already exists, yet there is no protocol to direct and give meaning to their interactions. We propose the first steps in the development of such a protocol, which would need to be adaptive, extensible, and open to the community, while promoting self-organization. We argue that devices, interacting through "game-like" moves, can learn to agree about how to communicate, with whom to cooperate, and how to delegate and coordinate specialized tasks. Like this, they may evolve distributed cognition or collective intelligence able to tackle any complex of tasks. %B Unifying Themes in Complex Systems %I Springer %C Berlin Heidelberg %V V %P 136-143 %G eng %U http://arxiv.org/abs/nlin.AO/0404004 %R 10.1007/978-3-642-17635-7_17 %0 Journal Article %J {PLoS ONE} %D 2011 %T Self-organization leads to supraoptimal performance in public transportation systems %A Carlos Gershenson %X The performance of public transportation systems affects a large part of the population. Current theory assumes that passengers are served optimally when vehicles arrive at stations with regular intervals. In this paper, it is shown that self-organization can improve the performance of public transportation systems beyond the theoretical optimum by responding adaptively to local conditions. This is possible because of a ``slower-is-faster'' effect, where passengers wait more time at stations but total travel times are reduced. The proposed self-organizing method uses ``antipheromones'' to regulate headways, which are inspired by the stigmergy (communication via environment) of some ant colonies. %B {PLoS ONE} %V 6 %P e21469 %G eng %U http://dx.doi.org/10.1371/journal.pone.0021469 %R 10.1371/journal.pone.0021469 %0 Book %B Lecture Notes in Computer Science %D 2011 %T Self-Organizing Systems 5th International Workshop, IWSOS 2011, Karlsruhe, Germany, February 23-24, 2011, Proceedings. Springer LNCS 6557 %E Christian Bettstetter %E Carlos Gershenson %X This book constitutes the refereed proceedings of the 5th International Workshop on Self-Organizing Systems, IWSOS 2011, held in Karlsruhe, Germany, in February 2011. The 9 revised full papers presented together with 1 invited paper were carefully selected from 25 initial submissions. It was the 5th workshop in a series of multidisciplinary events dedicated to self-organization in networked systems with main focus on communication and computer networks. The papers address theoretical aspects of self-organization as well as applications in communication and computer networks and robot networks. %B Lecture Notes in Computer Science %I Springer %V 6557 %@ 978-3-642-19166-4 %G eng %U http://dx.doi.org/10.1007/978-3-642-19167-1 %R 10.1007/978-3-642-19167-1 %0 Journal Article %J Complexity %D 2011 %T The Sigma Profile: A Formal Tool to Study Organization and its Evolution at Multiple Scales %A Carlos Gershenson %X The σ profile is presented as a tool to analyze the organization of systems at different scales, and how this organization changes in time. Describing structures at different scales as goal-oriented agents, one can define σ ∈ [0,1] (satisfaction) as the degree to which the goals of each agent at each scale have been met. σ reflects the organization degree at that scale. The σ profile of a system shows the satisfaction at different scales, with the possibility to study their dependencies and evolution. It can also be used to extend game theoretic models. The description of a general tendency on the evolution of complexity and cooperation naturally follows from the σ profile. Experiments on a virtual ecosystem are used as illustration. %B Complexity %V 16 %P 37-44 %G eng %U http://arxiv.org/abs/0809.0504 %R 10.1002/cplx.20350 %0 Journal Article %J International Journal of Artificial Life Research %D 2011 %T What does artificial life tell us about death? %A Carlos Gershenson %X Short philosophical essay %B International Journal of Artificial Life Research %V 2 %P 1-5 %G eng %U http://arxiv.org/abs/0906.2824 %0 Journal Article %J Paladyn, Journal of Behavioral Robotics %D 2010 %T Computing Networks: A General Framework to Contrast Neural and Swarm Cognitions %A Carlos Gershenson %X This paper presents the Computing Networks (CNs) framework. CNs are used to generalize neural and swarm architectures. Artificial neural networks, ant colony optimization, particle swarm optimization, and realistic biological models are used as examples of instantiations of CNs. The description of these architectures as CNs allows their comparison. Their differences and similarities allow the identification of properties that enable neural and swarm architectures to perform complex computations and exhibit complex cognitive abilities. In this context, the most relevant characteristics of CNs are the existence multiple dynamical and functional scales. The relationship between multiple dynamical and functional scales with adaptation, cognition (of brains and swarms) and computation is discussed. %B Paladyn, Journal of Behavioral Robotics %V 1 %P 147-153 %G eng %U http://dx.doi.org/10.2478/s13230-010-0015-z %R 10.2478/s13230-010-0015-z %0 Book Section %B {Artificial Life XII} Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems %D 2010 %T Modular Random {Boolean} Networks %A Rodrigo {Poblanno-Balp} %A Carlos Gershenson %E Harold Fellermann %E Mark Dörr %E Martin M. Hanczyc %E Lone Ladegaard Laursen %E Sarah Maurer %E Daniel Merkle %E Pierre-Alain Monnard %E Kasper St$ø$y %E Steen Rasmussen %B {Artificial Life XII} Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems %I MIT Press %C Odense, Denmark %P 303-304 %G eng %U http://mitpress.mit.edu/books/chapters/0262290758chap56.pdf %0 Unpublished Work %D 2009 %T Modeling self-organizing traffic lights with elementary cellular automata %A Carlos Gershenson %A David A. Rosenblueth %X There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. The simplicity of the model offers a clear understanding of the main properties of city traffic and its phase transitions. We use the proposed model to compare two methods for coordinating traffic lights: a green-wave method that tries to optimize phases according to expected flows and a self-organizing method that adapts to the current traffic conditions. The self-organizing method delivers considerable improvements over the green-wave method. For low densities, the self-organizing method promotes the formation and coordination of platoons that flow freely in four directions, i.e. with a maximum velocity and no stops. For medium densities, the method allows a constant usage of the intersections, exploiting their maximum flux capacity. For high densities, the method prevents gridlocks and promotes the formation and coordination of "free-spaces" that flow in the opposite direction of traffic. %G eng %U http://arxiv.org/abs/0907.1925 %0 Journal Article %J {PLoS ONE} %D 2009 %T Why does public transport not arrive on time? The pervasiveness of equal headway instability %A Carlos Gershenson %A Luis A. Pineda %X Background The equal headway instability phenomenon is pervasive in public transport systems. This instability is characterized by an aggregation of vehicles that causes inefficient service. While equal headway instability is common, it has not been studied independently of a particular scenario. However, the phenomenon is apparent in many transport systems and can be modeled and rectified in abstraction. Methodology We present a multi-agent simulation where a default method with no restrictions always leads to unstable headways. We discuss two methods that attempt to achieve equal headways, called minimum and maximum. Since one parameter of the methods depends on the passenger density, adaptive versions–-where the relevant parameter is adjusted automatically–-are also put forward. Our results show that the adaptive maximum method improves significantly over the default method. The model and simulation give insights of the interplay between transport design and passenger behavior. Finally, we provide technological and social suggestions for engineers and passengers to help achieve equal headways and thus reduce delays. Conclusions The equal headway instability phenomenon can be avoided with the suggested technological and social measures. %B {PLoS ONE} %V 4 %P e7292 %G eng %U http://dx.doi.org/10.1371/journal.pone.0007292 %R 10.1371/journal.pone.0007292 %0 Book %D 2008 %T Complexity: 5 Questions %E Carlos Gershenson %I Automatic Peess / VIP %@ 8792130135 %G eng %U http://tinyurl.com/ovg3jn %0 Journal Article %J Artificial Life %D 2008 %T Evolution of Complexity %A Carlos Gershenson %A Tom Lenaerts %B Artificial Life %V 14 %P 1–3 %8 Summer %G eng %U http://dx.doi.org/10.1162/artl.2008.14.3.14300 %R 10.1162/artl.2008.14.3.14300 %0 Journal Article %J International Journal of Public Information Systems %D 2008 %T Towards Self-organizing Bureaucracies %A Carlos Gershenson %X The goal of this paper is to contribute to eGovernment efforts, encouraging the use of self-organization as a method to improve the efficiency and adaptability of bureaucracies and similar social systems. Bureaucracies are described as networks of agents, where the main design principle is to reduce local "friction" to increase local and global "satisfaction". Following this principle, solutions are proposed for improving communication within bureaucracies, sensing public satisfaction, dynamic modification of hierarchies, and contextualization of procedures. Each of these reduces friction between agents (internal or external), increasing the efficiency of bureaucracies. Current technologies can be applied for this end. "Random agent networks" (RANs), novel computational models, are introduced to illustrate the benefits of self-organizing bureaucracies. Simulations show that only few changes are required to reach near-optimal performance, potentially adapting quickly and effectively to shifts in demand. %B International Journal of Public Information Systems %V 2008 %P 1–24 %G eng %U http://www.ijpis.net/issues/no1_2008/no1_2008_p1.htm %0 Book Section %B Complexity, Science and Society %D 2007 %T Complexity and Philosophy %A Francis Heylighen %A Paul Cilliers %A Carlos Gershenson %E Jan Bogg %E Robert Geyer %B Complexity, Science and Society %I Radcliffe Publishing %C Oxford %P 117-134 %G eng %U http://arxiv.org/abs/cs.CC/0604072 %0 Book %D 2007 %T Design and Control of Self-organizing Systems %A Carlos Gershenson %K Complexity Theory %K Physics %K Self-organization %X Complex systems are usually difficult to design and control. There are several particular methods for coping with complexity, but there is no general approach to build complex systems. In this book I pro- pose a methodology to aid engineers in the design and control of com- plex systems. This is based on the description of systems as self- organizing. Starting from the agent metaphor, the methodology pro- poses a conceptual framework and a series of steps to follow to find proper mechanisms that will promote elements to find solutions by ac- tively interacting among themselves. The main premise of the method- ology claims that reducing the "friction" of interactions between el- ements of a system will result in a higher "satisfaction" of the system, i.e. better performance. A general introduction to complex thinking is given, since designing self-organizing systems requires a non-classical thought, while prac- tical notions of complexity and self-organization are put forward. To illustrate the methodology, I present three case studies. Self-organizing traffic light controllers are proposed and studied with multi-agent simulations, outperforming traditional methods. Methods for im- proving communication within self-organizing bureaucracies are ad- vanced, introducing a simple computational model to illustrate the benefits of self-organization. In the last case study, requirements for self-organizing artifacts in an ambient intelligence scenario are dis- cussed. Philosophical implications of the conceptual framework are also put forward. %I CopIt Arxives %C Mexico %@ 978-0-9831172-3-0 %G eng %U http://tinyurl.com/DCSOS2007 %0 Thesis %D 2007 %T Design and Control of Self-organizing Systems %A Carlos Gershenson %X Complex systems are usually difficult to design and control. There are several particular methods for coping with complexity, but there is no general approach to build complex systems. In this thesis I propose a methodology to aid engineers in the design and control of complex systems. This is based on the description of systems as self-organizing. Starting from the agent metaphor, the methodology proposes a conceptual framework and a series of steps to follow to find proper mechanisms that will promote elements to find solutions by actively interacting among themselves. The main premise of the methodology claims that reducing the ``friction'' of interactions between elements of a system will result in a higher ``satisfaction'' of the system, i.e. better performance. A general introduction to complex thinking is given, since designing self-organizing systems requires a non-classical thought, while practical notions of complexity and self-organization are put forward. To illustrate the methodology, I present three case studies. Self-organizing traffic light controllers are proposed and studied with multi-agent simulations, outperforming traditional methods. Methods for improving communication within self-organizing bureaucracies are advanced, introducing a simple computational model to illustrate the benefits of self-organization. In the last case study, requirements for self-organizing artifacts in an ambient intelligence scenario are discussed. Philosophical implications of the conceptual framework are also put forward. %I Vrije Universiteit Brussel %C Brussels, Belgium %8 May %G eng %U http://cogprints.org/5442/ %9 phd %0 Book %B Worldviews, Science and Us %D 2007 %T Philosophy and Complexity %E Carlos Gershenson %E Diederik Aerts %E Bruce Edmonds %X Scientific, technological, and cultural changes have always had an impact upon philosophy. They can force a change in the way we perceive the world, reveal new kinds of phenomena to be understood, and provide new ways of understanding phenomena. Complexity science, immersed in a culture of information, is having a diverse but particularly significant impact upon philosophy. Previous ideas do not necessarily sit comfortably with the new paradigm, resulting in new ideas or new interpretations of old ideas. In this unprecedented interdisciplinary volume, researchers from different backgrounds join efforts to update thinking upon philosophical questions with developments in the scientific study of complex systems. The contributions focus on a wide range of topics, but share the common goal of increasing our understanding and improving our descriptions of our complex world. This revolutionary debate includes contributions from leading experts, as well as young researchers proposing fresh ideas. %B Worldviews, Science and Us %I World Scientific %C Singapore %G eng %U http://www.worldscibooks.com/chaos/6372.html %0 Book Section %B Self-Organization: Applied Multi-Agent Systems %D 2007 %T Self-organizing traffic lights: A realistic simulation %A Seung Bae Cools %A Carlos Gershenson %A Bart {D'Hooghe} %E Mikhail Prokopenko %X We have previously shown in an abstract simulation (Gershenson, 2005) that self-organizing traffic lights can improve greatly traffic flow for any density. In this paper, we extend these results to a realistic setting, implementing self-organizing traffic lights in an advanced traffic simulator using real data from a Brussels avenue. On average, for different traffic densities, travel waiting times are reduced by 50% compared to the current green wave method. %B Self-Organization: Applied Multi-Agent Systems %I Springer %P 41–49 %G eng %U http://arxiv.org/abs/nlin.AO/0610040 %& 3 %R 10.1007/978-1-84628-982-8_3 %0 Book Section %B Complexity, Science and Society %D 2007 %T Towards a General Methodology for Designing Self-Organizing Systems %A Carlos Gershenson %E Jan Bogg %E Robert Geyer %B Complexity, Science and Society %I Radcliffe Publishing %C Oxford %G eng %0 Conference Paper %B {ALife X} Workshop Proceedings %D 2006 %T Evolution of Complexity: Introduction to the Workshop %A Carlos Gershenson %A Tom Lenaerts %B {ALife X} Workshop Proceedings %P 71–72 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0604069 %0 Generic %D 2006 %T A General Methodology for Designing Self-Organizing Systems %A Carlos Gershenson %I ECCO %G eng %U http://uk.arxiv.org/abs/nlin.AO/0505009 %0 Conference Paper %B {Artificial Life X}, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems. %D 2006 %T The Role of Redundancy in the Robustness of Random {Boolean} Networks %A Carlos Gershenson %A Stuart A. Kauffman %A Ilya Shmulevich %E Rocha, L. M. %E L. S. Yaeger %E M. A. Bedau %E D. Floreano %E R. L. Goldstone %E A. Vespignani %X Evolution depends on the possibility of successfully exploring fitness landscapes via mutation and recombination. With these search procedures, exploration is difficult in "rugged" fitness landscapes, where small mutations can drastically change functionalities in an organism. Random Boolean networks (RBNs), being general models, can be used to explore theories of how evolution can take place in rugged landscapes; or even change the landscapes. In this paper, we study the effect that redundant nodes have on the robustness of RBNs. Using computer simulations, we have found that the addition of redundant nodes to RBNs increases their robustness. We conjecture that redundancy is a way of "smoothening" fitness landscapes. Therefore, redundancy can facilitate evolutionary searches. However, too much redundancy could reduce the rate of adaptation of an evolutionary process. Our results also provide supporting evidence in favour of Kauffman's conjecture (Kauffman, 2000, p.195). %B {Artificial Life X}, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems. %I MIT Press %P 35–42 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0511018 %0 Book Section %B Managing Organizational Complexity: Philosophy, Theory and Application %D 2005 %T How Can We Think the Complex? %A Carlos Gershenson %A Francis Heylighen %E Kurt Richardson %X This chapter does not deal with specific tools and techniques for managing complex systems, but proposes some basic concepts that help us to think and speak about complexity. We review classical thinking and its intrinsic drawbacks when dealing with complexity. We then show how complexity forces us to build models with indeterminacy and unpredictability. However, we can still deal with the problems created in this way by being adaptive, and profiting from a complex system's capability for selforganization, and the distributed intelligence this may produce. %B Managing Organizational Complexity: Philosophy, Theory and Application %I Information Age Publishing %P 47–61 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0402023 %& 3 %0 Journal Article %J Complex Systems %D 2005 %T Self-Organizing Traffic Lights %A Carlos Gershenson %X Steering traffic in cities is a very complex task, since improving efficiency involves the coordination of many actors. Traditional approaches attempt to optimize traffic lights for a particular density and configuration of traffic. The disadvantage of this lies in the fact that traffic densities and configurations change constantly. Traffic seems to be an adaptation problem rather than an optimization problem. We propose a simple and feasible alternative, in which traffic lights self-organize to improve traffic flow. We use a multi-agent simulation to study three self-organizing methods, which are able to outperform traditional rigid and adaptive methods. Using simple rules and no direct communication, traffic lights are able to self-organize and adapt to changing traffic conditions, reducing waiting times, number of stopped cars, and increasing average speeds. %B Complex Systems %V 16 %P 29–53 %G eng %U http://www.complex-systems.com/pdf/16-1-2.pdf %0 Journal Article %J Cognitive Systems Research %D 2004 %T Cognitive Paradigms: Which One is the Best? %A Carlos Gershenson %X I discuss the suitability of different paradigms for studying cognition. I use a virtual laboratory that implements five different representative models for controlling animats: a rule-based system, a behaviour-based system, a concept-based system, a neural network, and a Braitenberg architecture. Through different experiments, I compare the performance of the models and conclude that there is no "best" model, since different models are better for different things in different contexts. Using the results as an empirical philosophical aid, I note that there is no "best" approach for studying cognition, since different paradigms have all advantages and disadvantages, since they study different aspects of cognition from different contexts. This has implications for current debates on "proper" approaches for cognition: all approaches are a bit proper, but none will be "proper enough". I draw remarks on the notion of cognition abstracting from all the approaches used to study it, and propose a simple classification for different types of cognition. %B Cognitive Systems Research %V 5 %P 135–156 %8 June %G eng %U http://dx.doi.org/10.1016/j.cogsys.2003.10.002 %0 Conference Paper %B Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems {(ALife} {IX)} %D 2004 %T Introduction to Random {Boolean} Networks %A Carlos Gershenson %E M. Bedau %E P. Husbands %E T. Hutton %E S. Kumar %E H. Suzuki %X The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study their generic properties. Like this, RBNs have been used for exploring the configurations where life could emerge. The fact that RBNs are a generalization of cellular automata makes their research a very important topic. The tutorial, intended for a broad audience, presents the state of the art in RBNs, spanning over several lines of research carried out by different groups. We focus on research done within artificial life, as we cannot exhaust the abundant research done over the decades related to RBNs. %B Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems {(ALife} {IX)} %C Boston, MA %P 160–173 %G eng %U http://arxiv.org/abs/nlin.AO/0408006 %0 Unpublished Work %D 2004 %T Phase Transitions in Random {Boolean} Networks with Different Updating Schemes %A Carlos Gershenson %X In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown that the statistical properties of Random Boolean networks change considerable according to the updating scheme. We study with computer simulations sensitivity to initial conditions as a measure of order/chaos. We find that independently of their updating scheme, all network types have very similar phase transitions, namely when the average number of connections of nodes is between one and three. This critical value depends more on the size of the network than on the updating scheme. %G eng %U http://uk.arxiv.org/abs/nlin.AO/0311008 %0 Conference Paper %B Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems %D 2004 %T Updating Schemes in Random {Boolean} Networks: Do They Really Matter? %A Carlos Gershenson %E J. Pollack %E M. Bedau %E P. Husbands %E T. Ikegami %E R. A. Watson %X In this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the complexity reduction related to different updating schemes. We also report that all updating schemes yield very similar critical stability values, meaning that the "edge of chaos" does not depend much on the updating scheme. After discussion, we conclude that synchonous RBNs are justifiable theoretical models of biological networks. %B Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems %I MIT Press %P 238–243 %G eng %U http://arxiv.org/abs/nlin.AO/0402006 %0 Conference Paper %B {IJCAI}-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence %D 2003 %T Comparing Different Cognitive Paradigms with a Virtual Laboratory %A Carlos Gershenson %X A public virtual laboratory is presented, where animats are controlled by mechanisms from different cognitive paradigms. A brief description of the characteristics of the laboratory and the uses it has had is given. Mainly, it has been used to contrast philosophical ideas related with the notion of cognition, and to elucidate debates on "proper" paradigms in AI and cognitive science. %B {IJCAI}-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence %I Morgan Kaufmann %P 1635–1636 %G eng %0 Conference Paper %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %D 2003 %T Contextual Random {Boolean} Networks %A Carlos Gershenson %A Jan Broekaert %A Diederik Aerts %E Banzhaf, W %E T. Christaller %E P. Dittrich %E J. T. Kim %E J. Ziegler %X We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks (Gershenson, 2002) as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same networks, namely the average number of attractors and the average percentage of states in attractors. We introduce the situation where we lack knowledge on the context as a more realistic model for contextual dynamical systems. We notice that this makes the network non-deterministic in a specific way, namely introducing a non-Kolmogorovian quantum-like structure for the modelling of the network (Aerts 1986). In this case, for example, a state of the network has the potentiality (probability) of collapsing into different attractors, depending on the specific form of lack of knowledge on the context. %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %I Springer-Verlag %P 615–624 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0303021 %0 Journal Article %J IEEE Intelligent Systems %D 2003 %T The Meaning of Self-Organization in Computing %A Francis Heylighen %A Carlos Gershenson %B IEEE Intelligent Systems %P 72–75 %8 July/August %G eng %U http://pcp.vub.ac.be/Papers/IEEE.Self-organization.pdf %0 Unpublished Work %D 2003 %T Self-organizing Traffic Control: First Results %A Carlos Gershenson %X We developed a virtual laboratory for traffic control where agents use different strategies in order to self-organize on the road. We present our first results where we compare the performance and behaviour promoted by environmental constrains and five different simple strategies: three inspired in flocking behaviour, one selfish, and one inspired in the minority game. Experiments are presented for comparing the strategies. Different issues are discussed, such as the important role of environmental constrains and the emergence of traffic lanes. %G eng %U http://uk.arxiv.org/abs/nlin.AO/0309039 %0 Conference Paper %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %D 2003 %T When Can We Call a System Self-Organizing? %A Carlos Gershenson %A Francis Heylighen %E Banzhaf, W %E T. Christaller %E P. Dittrich %E J. T. Kim %E J. Ziegler %X We do not attempt to provide yet another definition of self-organizing systems, nor review previous definitions. We explore the conditions necessary to describe self-organizing systems, inspired on decades of their study, in order to understand them better. These involve the dynamics of the system, and the purpose, boundaries, and description level chosen by an observer. We show how, changing the level or ``graining'' of description, the same system can be self-organizing or not. We also discuss common problems we face when studying self-organizing systems. We analyse when building, designing, and controlling artificial self-organizing systems is useful. We state that self-organization is a way of observing systems, not a class of systems. %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %I Springer %C Berlin %P 606–614 %G eng %U http://arxiv.org/abs/nlin.AO/0303020 %0 Unpublished Work %D 2002 %T Adaptive Development of Koncepts in Virtual Animats: Insights Into the Development of Knowledge %A Carlos Gershenson %X As a part of our effort for studying the evolution and development of cognition, we present results derived from synthetic experimentations in a virtual laboratory where animats develop koncepts adaptively and ground their meaning through action. We introduce the term "koncept" to avoid confusions and ambiguity derived from the wide use of the word "concept". We present the models which our animats use for abstracting koncepts from perceptions, plastically adapt koncepts, and associate koncepts with actions. On a more philosophical vein, we suggest that knowledge is a property of a cognitive system, not an element, and therefore observer-dependent. %G eng %U http://uk.arxiv.org/abs/cs/0211027 %0 Conference Paper %B Proceedings of the 2nd Workshop on Epigenetic Robotics %D 2002 %T Behaviour-Based Knowledge Systems: An Epigenetic Path from Behaviour to Knowledge %A Carlos Gershenson %E Christopher G. Prince %E Yiannis Demiris %E Yuval Marom %E Hideki Kozima %E Christian Balkenius %X In this paper we expose the theoretical background underlying our current research. This consists in the development of behaviour-based knowledge systems, for closing the gaps between behaviour-based and knowledge-based systems, and also between the understandings of the phenomena they model. We expose the requirements and stages for developing behaviour-based knowledge systems and discuss their limits. We believe that these are necessary conditions for the development of higher order cognitive capacities, in artificial and natural cognitive systems. %B Proceedings of the 2nd Workshop on Epigenetic Robotics %I Lund University Cognitive Studies %C Edinburgh, Scotland %V 94 %P 35–41 %G eng %U http://www.lucs.lu.se/ftp/pub/LUCS%5FStudies/LUCS94/Gershenson.pdf %0 Conference Paper %B Artificial Life {VIII}: Proceedings of the Eight International Conference on Artificial Life %D 2002 %T Classification of Random {Boolean} Networks %A Carlos Gershenson %E Standish, R. K. %E M. A. Bedau %E H. A. Abbass %X We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Particularly, we find that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on their synchronicity or asynchronicity. We also show a way of mapping non-synchronous deterministic RBNs into synchronous RBNs. Our results are important for justifying the use of specific types of RBNs for modelling natural phenomena. %B Artificial Life {VIII}: Proceedings of the Eight International Conference on Artificial Life %I MIT Press %C Cambridge, MA, USA %P 1–8 %G eng %U http://arxiv.org/abs/cs/0208001 %0 Thesis %D 2002 %T A Comparison of Different Cognitive Paradigms Using Simple Animats in a Virtual Laboratory, with Implications to the Notion of Cognition %A Carlos Gershenson %X In this thesis I present a virtual laboratory which implements five different models for controlling animats: a rule-based system, a behaviour-based system, a concept-based system, a neural network, and a Braitenberg architecture. Through different experiments, I compare the performance of the models and conclude that there is no ``best'' model, since different models are better for different things in different contexts. The models I chose, although quite simple, represent different approaches for studying cognition. Using the results as an empirical philosophical aid, I note that there is no ``best'' approach for studying cognition, since different approaches have all advantages and disadvantages, because they study different aspects of cognition from different contexts. This has implications for current debates on ``proper'' approaches for cognition: all approaches are a bit proper, but none will be ``proper enough''. I draw remarks on the notion of cognition abstracting from all the approaches used to study it, and propose a simple classification for different types of cognition. %I School of Cognitive and Computing Sciences, University of Sussex %G eng %U http://www.cogs.susx.ac.uk/easy/Publications/Online/MSc2002/cg26.pdf %9 masters %0 Conference Paper %B Proceedings of the 1st Biennial Seminar on Philosophical, Methodological $\And$ Epistemological Implications of Complexity Theory %D 2002 %T Complex Philosophy %A Carlos Gershenson %X We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing regularities in nature. We define absolute being (observer independent, infinite) and relative being (observer dependent, finite), and notice the differences between them. We draw issues on relative causality and absolute causality among abstraction levels. We also make reflections on determinism. We reject the search for any absolute truth (because of their infinity), and promote the idea that all comprehensible truths are relative, since they were created in finite contexts. This leads us to suggest to search the less-incompleteness of ideas and contexts instead of their truths. %B Proceedings of the 1st Biennial Seminar on Philosophical, Methodological $\And$ Epistemological Implications of Complexity Theory %C La Habana, Cuba %G eng %U http://uk.arXiv.org/abs/nlin.AO/0109001 %0 Unpublished Work %D 2002 %T Contextuality: A Philosophical Paradigm, with Applications to Philosophy of Cognitive Science %A Carlos Gershenson %X We develop on the idea that everything is related, inside, and therefore determined by a context. This stance, which at first might seem obvious, has several important consequences. This paper first presents ideas on Contextuality, for then applying them to problems in philosophy of cognitive science. Because of space limitations, for the second part we will assume that the reader is familiar with the literature of philosophy of cognitive science, but if this is not the case, it would not be a limitation for understanding the main ideas of this paper. We do not argue that Contextuality is a panaceic answer for explaining everything, but we do argue that everything is inside a context. And because this is always, we sometimes ignore it, but we believe that many problems are dissolved with a contextual approach, noticing things we ignore because of their obviousity. We first give a notion of context. We present the idea that errors are just incongruencies inside a context. We also present previous ideas of absolute being, relative being, and lessincompleteness. We state that all logics, and also truth judgements, are contextdependent, and we develop a ``Context-dependant Logic''. We apply ideas of Contextuality to problems in semantics, the problem of ``where is the mind'', and the study of consciousness. %G eng %U http://cogprints.org/2621/ %0 Journal Article %J Journal of Artificial Societies and Social Simulation %D 2002 %T Philosophical Ideas on the Simulation of Social Behaviour %A Carlos Gershenson %X In this study we consider some of the philosophical issues that should be taken into account when simulating social behaviour. Even though the ideas presented here are philosophical, they should be of interest more to researchers simulating social behaviour than to philosophers, since we try to note some problems that researchers might not put much attention to. We give notions of what could be considered a social behaviour, and mention the problems that arise if we attempt to give a sharp definition of social behaviour in a broad context. We also briefly give useful concepts and ideas of complex systems and abstraction levels (Gershenson, 2002a), since any society can be seen as a complex system. We discuss the problems that arise while modelling social behaviour, mentioning the synthetic method as a useful approach for contrasting social theories, because of the complexities of the phenomena they model. In addition, we note the importance of the study of social behaviour for the understanding of cognition. We hope that the ideas presented here motivate the interest and debate of researchers simulating social behaviour in order to pay attention to the problems mentioned in this work, and attempt to provide more suitable solutions to them than the ones proposed here. %B Journal of Artificial Societies and Social Simulation %V 5 %G eng %U http://jasss.soc.surrey.ac.uk/5/3/8.html %0 Unpublished Work %D 2002 %T Where is the problem of ``Where is the mind?''? %A Carlos Gershenson %X We propose that the discussions about ``where the mind is'' depend directly on the metaphysical preconception and definition of ``mind''. If we see the mind from one perspective (individualist), it will be only in the brain, and if we see it from another (active externalist), it will be embedded in the body and extended into the world. The ``whereabouts'' of the mind depends on our 1 of mind. Therefore, we should not ask if the mind is somewhere, but if it is somehow. %G eng %U http://cogprints.org/2620/ %0 Unpublished Work %D 2001 %T Artificial Societies of Intelligent Agents %A Carlos Gershenson %X In this thesis we present our work, where we developed artificial societies of intelligent agents, in order to understand and simulate adaptive behaviour and social processes. We obtain this in three parallel ways: First, we present a behaviours production system capable of reproducing a high number of properties of adaptive behaviour and of exhibiting emergent lower cognition. Second, we introduce a simple model for social action, obtaining emergent complex social processes from simple interactions of imitation and induction of behaviours in agents. And third, we present our approximation to a behaviours virtual laboratory, integrating our behaviours production system and our social action model in animats. In our behaviours virtual laboratory, the user can perform a wide variety of experiments, allowing him or her to test the properties of our behaviours production system and our social action model, and also to understand adaptive and social behaviour. It can be accessed and downloaded through the Internet. Before presenting our proposals, we make an introduction to artificial intelligence and behaviour-based systems, and also we give notions of complex systems and artificial societies. In the last chapter of the thesis, we present experiments carried out in our behaviours virtual laboratory showing the main properties of our behaviours production system, of our social action model, and of our behaviours virtual laboratory itself. Finally, we discuss about the understanding of adaptive behaviour as a path for understanding cognition and its evolution. %I Fundación Arturo Rosenblueth %G eng %U http://cogprints.org/1477/ %0 Conference Paper %B Proceedings of the First International Conference on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics %D 2001 %T Comments to Neutrosophy %A Carlos Gershenson %E Florentin Smarandache %X Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them. But this does not mean that it is finished, and it can always be improved. The comments presented here are an attempt to make Neutrosophy even less-incomplete. I argue that less-incomplete ideas are more useful, since we cannot perceive truth or falsity or indeterminacy independently of a context, and are therefore relative. Absolute being and relative being are defined. Also the "silly theorem problem" is posed, and its partial solution described. The issues arising from the incompleteness of our contexts are presented. We also note the relativity and dependance of logic to a context. We propose "metacontextuality" as a paradigm for containing as many contexts as we can, in order to be less-incomplete and discuss some possible consequences. %B Proceedings of the First International Conference on Neutrosophy, Neutrosophic Logic, Set, Probability and Statistics %I Xiquan %C University of New Mexico, Gallup, NM %P 139–146 %G eng %U http://uk.arxiv.org/abs/math.GM/0111237 %0 Conference Paper %B Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society {(NAFIPS} '99) %D 1999 %T Modelling Emotions with Multidimensional Logic %A Carlos Gershenson %X One of the objectives of Artificial Intelligence has been the modelling of "human" characteristics, such as emotions, behaviour, conscience, etc. But in such characteristics we might find certain degree of contradiction. Previous work on modelling emotions and its problems are reviewed. A model for emotions is proposed using multidimensional logic, which handles the degree of contradiction that emotions might have. The model is oriented to simulate emotions in artificial societies. The proposed solution is also generalized for actions which might overcome contradiction (conflictive goals in agents, for example). %B Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society {(NAFIPS} '99) %I IEEE Press %C New York City, NY %P 42–46 %G eng %U http://tinyurl.com/yek3ms %0 Conference Paper %B Memorias {XI} Congreso Nacional {ANIEI} %D 1998 %T Control de Tráfico con Agentes: {CRASH} %A Carlos Gershenson %X El simulador CRASH (Car and Road Automated Simulation in Hyperways) usa programación orientada a agentes para modelar el tráfico de una ciudad sin necesidad de semáforos, tratando de demorar los veh\'ıculos el menor tiempo posible (y sin que se impacten). Esto se hace por medio de agentes en cada automóvil y en cada cruce, y un control central. Se hace una breve introducción al modelo de programación orientada a agentes, para después explicar el modelo del simulador. Se describen las clases usadas en la implementación, sus propiedades y sus relaciones, mostrando el diagrama de las clases. Finalmente, se exponen las conclusiones que se llegaron con las simulaciones. %B Memorias {XI} Congreso Nacional {ANIEI} %C Xalapa, México %G eng %U http://tinyurl.com/ybgwk8 %0 Conference Paper %B Memorias {XI} Congreso Nacional {ANIEI} %D 1998 %T Lógica Multidimensional: Un Modelo de Lógica Paraconsistente %A Carlos Gershenson %X La lógica multidimensional es un nuevo sistema de lógica propuesto para modelar lógica paraconsistente. Una breve definición de lógica paraconsistente y ejemplos de cuando es usada son dados. Se definen los principios y propiedades de la lógica multidimensional, tales como las variables lógicas multidimensionales. Los operadores lógicos Y, O, NO, SI... ENTONCES y SI Y SÓLO SI son definidos y explicados para la lógica multidimensional. Además, se definen equivalencia, grado de contradicción, y la proyección de la lógica multidimensional en la difusa. Esto incluye un pequeño programa que %B Memorias {XI} Congreso Nacional {ANIEI} %C Xalapa, México %P 132–141 %G eng %U http://tinyurl.com/y9hb4e %0 Conference Paper %B Memorias X Congreso Nacional {ANIEI} %D 1997 %T Aplicaciones de la Topología %A Carlos Gershenson %X En el presente trabajo se abordan algunas aplicaciones de la Topolog\'ıa en la Computación, como el Juego de la Vida. Se tratan de ampliar los conocimientos actuales sobre estas aplicaciones y sus representaciones gráficas. Se apoya la exposición con un simulador de tiempo c\'ıclico. También se hace una propuesta para definir el Universo como un tiempo c\'ıclico. %B Memorias X Congreso Nacional {ANIEI} %C Monterrey, México %G eng %U http://tinyurl.com/ym5vbz %0 Conference Paper %B Memorias X Congreso Nacional {ANIEI} %D 1997 %T El Juego de la Vida En 3D %A Carlos Gershenson %X Primero se introduce al lector con un poco de la historia del Juego de la Vida. Después se explican sus consecuencias en dos dimensiones, y por último se discuten sus propiedades al llevar el Juego de la Vida a una tercera dimensión, y se muestran algunos ejemplos. %B Memorias X Congreso Nacional {ANIEI} %C Monterrey, México %G eng %U http://tinyurl.com/y9j5ac