Related to information content of the universe
Base of log for algorithmic information content?
In time t, how many distinct rules can I reach?
To specify a new rule, I have to give a certain amount of data.
Assume the rulial multiway graph is a binary tree. In each elementary time, there is additional one bit needed to specify which branch you are on.
[ Maximum rate at which you can learn about the rule for the universe? ]
Maximum rate at which you can change your description of the universe ;
changing your description is like having another prefix for your program ; so unit is bits/second
Assume physical laws take a certain number of bits to describe
Maximum rate of being able to describe the world in terms of new laws
is descriptional complexity of universe (in bits) to us / elementary time
[ Normalized by the way we choose to measure content of a theory ]
Elementary length in rulial space: shortest distance between two neighboring rules....
Quantization of theories | quantum of difference between theories
is smallest distance between theories / elementary time
Maximum speed is a consequence of computational irreducibility ; rate of converting between irreducible
Want to describe something different ... then can compute [[[ ? predict different kinds of things ]]]
Fundamental base to information content like moles are base to amount of substance