A working group at the Santa Fe Institute recently convened to further ecological and evolutionary theory and craft an application for a National Science Foundation (NSF) “Rules of Life” grant.
In a November SFI Community Lecture, External Professor Michelle Girvan described an exciting new approach to predicting chaotic systems. Watch her talk here.
A study co-authored by SFI Omidyar Fellow Jacopo Grilli sheds new light on a long-standing question about what triggers cell division.
Introduction to the Theory of Complex Systems synthesizes hundreds of disparate findings in complexity and articulates a single, underlying characteristic of complex systems.
Identifying meaningful information is a key challenge to disciplines from biology to artificial intelligence. In a new paper, SFI's Artemy Kolchinsky and David Wolpert propose a broadly applicable, fully formal definition for this kind of semantic information.
Sending instantaneous messages across long distances, or quickly computing over ungodly amounts of data are just two possibilities that arise if we can design computers to exploit quantum uncertainty, entanglement, and measurement. In this SFI Community Lecture, scientist Christopher Monroe describes the architecture of a quantum computer based on individual atoms, suspended and isolated with electric fields, and individually addressed with laser beams.
October 13-16, graduate students can meet with leading scientists to learn about modeling and evaluating the future of human populations and their environments. Free tuition for accepted students. Apply before July 11, 2018.
An SFI workshop examines the key impediments to building machines that understand meaning, and how much understanding is necessary for artificially intelligent machines to approach human-level abilities in language, perception, and reasoning.
The autumn Applied Complexity Network meeting “Risk: Retrospective Lessons and Prospective Strategies,” explores what we have learned since the financial crisis of 2008.
In a two-part lecture series September 24 and 25, SFI Professor Cristopher Moore looked at two sides of computation — the mathematical structures that make problems easy or hard, and the growing debate about fairness in algorithmic predictions. The videos are now available.