Randomness

From PKC
Revision as of 04:58, 6 September 2021 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In theoretical computing, randomness is considered to be a kind of fundamental resource, along with time and space. It turns out, randomness is computationally derived through the unique combination of space and time labels to identify the correctness of computational results. Randomness is often measured in terms of entropy. This notion allows randomness to be bound with a defined namespace in terms of named ordered event entries as timestamps, and uniquely distinguishable data storage resource as space, and by leveraging the unpredictability of data synchronicity, it creates a notion of entropy pool, which provides some mathematically measurable/testable property for correctness.