All Questions
Tagged with algorithms information
3
questions
5
votes
2
answers
361
views
Is the universe's Kolmogorov complexity growing over time?
The Kolmogorov complexity of a deterministic universe is constant.
The Kolmogorov complexity of a nondeterministic universe grows over time. It grows whenever something happens that is not ...
3
votes
3
answers
782
views
Has anyone ever tried to formulate physics based on computer science or information processing?
Some physicists and university researchers say it's possible to test the theory that our entire universe exists inside a computer simulation, like in the 1999 film "The Matrix." In 2003, University of ...
29
votes
4
answers
840
views
Upper bounding the Kolmogorov Complexity of the Standard Model
The Kolmogorov complexity of a hypothesis/theory/model is the shortest computer program that simulates it, regardless of how inefficient executing that program may be in terms of memory and time. I'm ...