Irreducibility and Computational Equivalence

<p>It is clear that computation is playing an increasingly prominent role in the development of mathematics, as well as in the natural and social sciences. The work of Stephen Wolfram over the last several decades has been a salient part in this phenomenon helping founding the field of Complex Systems, with many of his constructs and ideas incorporated in his book A New Kind of Science (ANKS) becoming part of the scientific discourse and general academic knowledge--from the now established Elementary Cellular Automata to the unconventional concept of mining the Computational Universe, from today's widespread Wolfram's Behavioural Classification to his principles of Irreducibility and Computational Equivalence.</p><p>This volume, with a Foreword by Gregory Chaitin and an Afterword by Cris Calude, covers these and other topics related to or motivated by Wolfram's seminal ideas, reporting on research undertaken in the decade following the publication of Wolfram's NKS book. Featuring 39 authors, its 23 contributions are organized into seven parts: </p><p>Mechanisms in Programs & Nature</p><p>Systems Based on Numbers & Simple Programs </p><p>Social and Biological Systems & Technology </p><p>Fundamental Physics</p><p>The Behavior of Systems & the Notion of Computation</p><p>Irreducibility & Computational Equivalence</p><p>Reflections and Philosophical Implications.</p><p>

שנה

2013

שפה

English

סדרה

Emergence, Complexity and Computation -- 2

הוצאה

Springer Berlin Heidelberg

מהדורות

4

עמודים

358

ISBN

9783642354823

מקור הנתונים: Wikidata