Empirical Encounters with Computational Irreducibility and Unpredictability

Míreanna comhchosúla

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