
Irreducibility and Computational Equivalence
by Hector Zenil
Book 2 of Emergence, Complexity and Computation --
No club is reading this yet — be the first to start one
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.
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:
Mechanisms in Programs & Nature
Systems Based on Numbers & Simple Programs
Social and Biological Systems & Technology
Fundamental Physics
The Behavior of Systems & the Notion of Computation
Irreducibility & Computational Equivalence
Reflections and Philosophical Implications.
Discuss Irreducibility and Computational Equivalence with other readers
Join or start a book club for Irreducibility and Computational Equivalence on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Irreducibility and Computational Equivalence?
Sign up free on Readfeed, then browse public clubs or start your own club with Irreducibility and Computational Equivalence as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Irreducibility and Computational Equivalence with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Irreducibility and Computational Equivalence with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.