Empirical Encounters with Computational Irreducibility and Unpredictability

Samankaltaisia teoksia

• Irreducibility and Computational Equivalence: Ten Years After the Publication of Wolfram's A New Kind of Science‚ Series: Emergence‚ Complexity and Computation
  Tekijä: H.Zenil (ed).
  Julkaistu: (2013)
• Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines
  Tekijä: Joosten, J, et al.
  Julkaistu: (2013)
• Fractal Dimension versus Process Complexity
  Tekijä: Joost J. Joosten, et al.
  Julkaistu: (2016-01-01)
• A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
  Tekijä: Fernando Soler-Toscano, et al.
  Julkaistu: (2017-01-01)
• Computing irreducible representations of two-generator groups
  Tekijä: Sarmin, Nor Haniza, et al.
  Julkaistu: (2009)