Negative Entropy
Table of Contents
Thoughts:
If information could be destroyed, if system could forget then an algorithm to gurantee record were made at a given date can be made.
e.g. prove that the journey entry you wrote wasn't written retroactively without making public anything beforehand.
only if a subsequence had greater information than a full sequence. This seems impossible. And is.
So, are computer timeless? You can do any task now exactly as you could do it in past (of course taskts that don't interact with environment) (or rather this is equivalent to saying there can't be absolute measure of time only relative)
