December 1987
·
20 Reads
·
134 Citations
What is this page?
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
Publications (1)
Citations (1)
... In information theory, algorithmic complexity captures the link between complexity and uncertainty in terms of compressibility: it states that the complexity of a system is equal to the size of the minimal computational resources required to generate this system [24]. It should be noted that complete randomness also corresponds to minimal uncertainty, so complexity is intermediate between a random sequence and a perfectly orderly one as mentioned above [19,25]. ...
- Citing Chapter
December 1987