Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
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.
Imran Nasim, Melanie Weber
SCML 2024
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998