Abstract
Wolfram’s Principle of Computational Equivalence (PCE) implies that universal complexity abounds in nature. This paper comprises three sections. In the first section we consider the question why there are so many universal phenomena around. So, in a sense, we seek a driving force behind the PCE if any. We postulate a principle GNS that we call the Generalized Natural Selection principle that together with the Church-Turing thesis is seen to be equivalent in a sense to a weak version of PCE. In the second section we ask the question why we do not observe any phenomena that are complex but not-universal. We choose a cognitive setting to embark on this question and make some analogies with formal logic.
In the third and final section we report on a case study where we see rich structures arise everywhere.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)
Bennett, C.H.: The Thermodynamics of Computation - A Review. Int. J. Theoretical Physics 21(12), 905–940 (1982)
Calude, C.S., Stay, M.A.: Most programs stop quickly or never halt. Advances in Applied Mathematics 40, 295–308 (2005)
Calude, C.S., Paun, G.: Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing. CRC Press (2000)
Dawkins, R.: The Selfish Gene. Oxford University Press, New York City (1976) ISBN 0-19-286092-5
Fodor, J.A.: Modules, Frames, Fridgeons, Sleeping Dogs, and the Music of the Spheres. In: Pylyshyn (1987)
Joosten, J.J.: Turing Machine Enumeration: NKS versus Lexicographical, Wolfram Demonstrations Project (2010), http://demonstrations.wolfram.com/TuringMachineEnumeratinNKSVersusLexicographical/
Joosten, J.J., Soler, F., Zenil, H.: Program-size versus Time Complexity. Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. Int. Journ. of Unconventional Computing 7, 353–387 (2011)
Joosten, J.J., Soler Toscano, F., Zenil, H.: Turing machine runtimes per number of states. To appear in Wolfram Demonstrations Project (2012)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer (2010)
Pitowsky, I.: The Physical Church Thesis and Physical Computational Complexity. Iyyun, A Jerusalem Philosophical Quarterly 39, 81–99 (1990)
Schrödinger, E.: What is Life? Cambridge University Press (1944)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Zenil, H., Soler Toscano, F., Joosten, J.J.: Empirical encounters with computational irreducibility and unpredictability. Minds and Machines 21 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Joosten, J.J. (2013). On the Necessity of Complexity. In: Zenil, H. (eds) Irreducibility and Computational Equivalence. Emergence, Complexity and Computation, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35482-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-35482-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35481-6
Online ISBN: 978-3-642-35482-3
eBook Packages: EngineeringEngineering (R0)