people:chris_symonds:abstract_outcome
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
people:chris_symonds:abstract_outcome [2014/10/03 17:27] – csymonds | people:chris_symonds:abstract_outcome [2014/10/14 05:48] (current) – csymonds | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ===== The Evolution of Parochial Altruism in Robust Computational | + | ===== The Evolution of Parochial Altruism in a Robust Computational |
+ | ===Revised Abstract=== | ||
+ | Computational models of biological evolution have shown that both parochial and altruistic behaviors increase the fitness of the host by working in concert rather than on their own beneficial merits. The benefits of these mutually reinforcing behaviors include better resources management within an in-group through the elimination of out-groups. We present new models that allow for the evolution of parochial altruism in a robust computational system that show whether the biological benefits gained from these behaviors can find a correlate effect on fitness in a robust-first environment. Wide variation in resource availability within this computational system can give rise to " | ||
- | ===Abstract=== | + | |
- | The paradigm of robust-first computing entails an infinitely scale-able environment in which elemental programs interact with each other to create emergent computational behaviors. The usefulness of such behaviors and the fitness of such elements can hold analogous properties to the system of biological evolution in the natural world. This paper will outline research that seeks to explore the evolution of parochial altruism in biological systems by modeling this behavior in a robust-first computational environment. We seek to determine whether the natural evolution of parochial altruism in the biological world, and the increased fitness that it brings, will find a correlate advantage to the elemental programs of robust-first computation, | + | ===Introduction? |
+ | The paradigm of robust-first computing entails an infinitely scale-able environment in which elemental programs interact with each other to create emergent computational behaviors. The usefulness of such behaviors and the fitness of such elements can hold analogous properties to the system of biological evolution in the natural world. This paper will outline research that seeks to explore the evolution of parochial altruism in biological systems by modeling this behavior in a robust-first computational environment. We seek to determine whether the natural evolution of parochial altruism in the biological world, and the increased fitness that it brings, will find a correlate advantage to the elemental programs of robust-first computation, | ||
===Expected Outcome=== | ===Expected Outcome=== | ||
- | What we expect to find are the same results reached by the work of Choi and Bowles, wherein the prevalence of both Parochial Altruists and Non-Parochial Non-Altruists are significantly higher than that of just Altruists or just Parochials. That is, the emergence of each behavior serves to reinforce the other with a higher probability than either behavior flourishing alone. It is particularly expected that Non-Parochial Non-Altruists will have a propensity to emerge as a more ubiquitous trait category given the infinitely scale-able nature of the robust-first computation platform found in the Moveable Feast Machine. Thus, as the resources are scaled up, the prevalence of NPNAs will be more commonplace, | + | What we expect to find are the same results reached by the work of Choi and Bowles, wherein the prevalence of both Parochial Altruists and Non-Parochial Non-Altruists are significantly higher than that of just Altruists or just Parochials. That is, the emergence of each behavior serves to reinforce the other with a higher probability than either behavior flourishing alone. It is particularly expected that Non-Parochial Non-Altruists will have a propensity to emerge as a more ubiquitous trait category given the infinitely scale-able nature of the robust-first computation platform found in the Moveable Feast Machine. In other words, when there is little need to compete for resources, the groups that stay out of the fray will win out. Thus, as the resources are scaled up, the prevalence of NPNAs will be more commonplace, |
people/chris_symonds/abstract_outcome.1412357252.txt.gz · Last modified: 2014/10/03 17:27 by csymonds