Author: cxdig

Why People Harm the Environment Although They Try to Treat It Well: An Evolutionary-Cognitive Perspective on Climate Compensation

Anthropogenic climate changes stress the importance of understanding why people harm the environment despite their attempts to behave in climate friendly ways. This paper argues that one reason behind why people do this is that people apply heuristics, originally shaped to handle social exchange, on the issues of environmental impact. Reciprocity and balance in social relations have been fundamental to social cooperation, and thus to survival, and therefore the human brain has become specialized by natural selection to compute and seek this balance. When the same reasoning is applied to environment-related behaviors, people tend to think in terms of a balance between “environmentally friendly” and “harmful” behaviors, and to morally account for the average of these components rather than the sum. This balancing heuristic leads to compensatory green beliefs and negative footprint illusions—the misconceptions that “green” choices can compensate for unsustainable ones. “Eco-guilt” from imbalance in the moral environmental account may promote pro-environmental acts, but also acts that are seemingly pro-environmental but in reality more harmful than doing nothing at all. Strategies for handling problems caused by this cognitive insufficiency are discussed.

 

Why People Harm the Environment Although They Try to Treat It Well: An Evolutionary-Cognitive Perspective on Climate Compensation

Patrik Sörqvist and Linda Langeborg

Front. Psychol., 04 March 2019 | https://doi.org/10.3389/fpsyg.2019.00348

Source: www.frontiersin.org

On the Complex Behaviour of Natural and Artificial Machines and Systems

One of the most important aims of the fields of robotics, artificial intelligence and artificial life is the design and construction of systems and machines as versatile and as reliable as living organisms at performing high level human-like tasks. But how are we to evaluate artificial systems if we are not certain how to measure these capacities in living systems, let alone how to define life or intelligence? Here I survey a concrete metric towards measuring abstract properties of natural and artificial systems, such as the ability to react to the environment and to control one’s own behaviour.

 

On the Complex Behaviour of Natural and Artificial Machines and Systems
H. Zenil

Metrics of Sensory Motor Coordination and Integration in Robots and Animals pp 111-125

Source: link.springer.com

Postdoctoral Fellowships at the Centro de Ciencias de la Complejidad (C3), UNAM

The C3-UNAM announces that each year there will be 2 periods, April-May and December-January, that applications will be received for 2 postdoctoral grants from the UNAM to realize research at the C3-UNAM, starting in September and March, respectively (4 postdoc grants yearly). The purpose of the grants is to realize research in complexity science in one of the following areas: computational intelligence and mathematical modeling, complexity and health, neurosciences, ecological complexity and environment (postdoctoral grants for research in humanistic sciences such as social complexity, and arts, science and complexity will be announced separately), please find the academic programs that are developed at the C3-UNAM in the page:
https://www.c3.unam.mx/progacademicos.html
Technical details for the application are explained in the page:
http://dgapa.unam.mx/images/posdoc/2019_posdoc_convocatoria.pdf
The grants are for 1 year and renewable for a 2nd year in function of the results obtained.

Source: www.c3.unam.mx

An Exact No Free Lunch Theorem for Community Detection

A precondition for a No Free Lunch theorem is evaluation with a loss function which does not assume a priori superiority of some outputs over others. A previous result for community detection by Peel et al. (2017) relies on a mismatch between the loss function and the problem domain. The loss function computes an expectation over only a subset of the universe of possible outputs; thus, it is only asymptotically appropriate with respect to the problem size. By using the correct random model for the problem domain, we provide a stronger, exact No Free Lunch theorem for community detection. The claim generalizes to other set-partitioning tasks including core/periphery separation, k-clustering, and graph partitioning. Finally, we review the literature of proposed evaluation functions and identify functions which (perhaps with slight modifications) are compatible with an exact No Free Lunch theorem.

 

An Exact No Free Lunch Theorem for Community Detection
Arya D. McCarthy, Tongfei Chen, Seth Ebner

Source: arxiv.org