Yi Zhou, Parikshit Ram, et al.
ICLR 2023
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.
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990