↓ Skip to main content

Irreducibility and Computational Equivalence

Overview of attention for book
Cover of 'Irreducibility and Computational Equivalence'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Cellular Automata: Models of the Physical World
  3. Altmetric Badge
    Chapter 2 On the Necessity of Complexity
  4. Altmetric Badge
    Chapter 3 A Lyapunov View on the Stability of Two-State Cellular Automata
  5. Altmetric Badge
    Chapter 4 Cellular Automata and Hyperbolic Spaces
  6. Altmetric Badge
    Chapter 5 Symmetry and Complexity of Cellular Automata: Towards an Analytical Theory of Dynamical System
  7. Altmetric Badge
    Chapter 6 A New Kind of Science: Ten Years Later
  8. Altmetric Badge
    Chapter 7 More Complex Complexity: Exploring the Nature of Computational Irreducibility across Physical, Biological, and Human Social Systems
  9. Altmetric Badge
    Chapter 8 A New Kind of Finance
  10. Altmetric Badge
    Chapter 9 The Relevance of Computation Irreducibility as Computation Universality in Economics
  11. Altmetric Badge
    Chapter 10 Computational Technosphere and Cellular Engineering
  12. Altmetric Badge
    Chapter 11 The Principle of a Finite Density of Information
  13. Altmetric Badge
    Chapter 12 Do Particles Evolve?
  14. Altmetric Badge
    Chapter 13 Artificial Cosmogenesis: A New Kind of Cosmology
  15. Altmetric Badge
    Chapter 14 An Incompleteness Theorem for the Natural World
  16. Altmetric Badge
    Chapter 15 Pervasiveness of Universalities of Cellular Automata: Fascinating Life-Like Behaviours
  17. Altmetric Badge
    Chapter 16 A Spectral Portrait of the Elementary Cellular Automata Rule Space
  18. Altmetric Badge
    Chapter 17 Irreducibility and Computational Equivalence
  19. Altmetric Badge
    Chapter 18 Exploring Wolfram’s Notion of Computational Irreducibility with a Two-Dimensional Cellular Automaton
  20. Altmetric Badge
    Chapter 19 Unpredictability and Computational Irreducibility
  21. Altmetric Badge
    Chapter 20 Computational Equivalence and Classical Recursion Theory
  22. Altmetric Badge
    Chapter 21 Wolfram and the Computing Nature
  23. Altmetric Badge
    Chapter 22 A New Kind of Philosophy: Manifesto for a Digital Ontology
  24. Altmetric Badge
    Chapter 23 Free Will and A New Kind of Science
  25. Altmetric Badge
    Chapter 24 Erratum: Symmetry and Complexity of Cellular Automata: Towards an Analytical Theory of Dynamical System
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
18 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Irreducibility and Computational Equivalence
Published by
Springer Berlin Heidelberg, December 2012
DOI 10.1007/978-3-642-35482-3
ISBNs
978-3-64-235481-6, 978-3-64-235482-3
Editors

Zenil, Hector

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 18 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 1 6%
Unknown 17 94%

Demographic breakdown

Readers by professional status Count As %
Researcher 5 28%
Student > Master 4 22%
Student > Doctoral Student 2 11%
Student > Bachelor 2 11%
Student > Ph. D. Student 2 11%
Other 3 17%
Readers by discipline Count As %
Computer Science 6 33%
Mathematics 3 17%
Environmental Science 2 11%
Physics and Astronomy 2 11%
Economics, Econometrics and Finance 1 6%
Other 4 22%