English

On the necessity of complexity

Logic in Computer Science 2012-11-09 v1 Computational Complexity

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 week 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 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.

Keywords

Cite

@article{arxiv.1211.1878,
  title  = {On the necessity of complexity},
  author = {Joost J. Joosten},
  journal= {arXiv preprint arXiv:1211.1878},
  year   = {2012}
}

Comments

17 pages, 3 figures

R2 v1 2026-06-21T22:34:59.631Z