About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A note on the number of N-bit strings with maximum complexity
Abstract
Consider the number of n-bit strings that have exactly the maximum possible program-size complexity that an n-bit string can have. We show that this number is itself an n-bit string with nearly the maximum possible complexity. From this it follows that at least 2n-c n-bit strings have exactly the maximum complexity that it is possible for an n-bit string to have. © 1993.