Prefer a chat interface with context about you and your work?
SECOND QUANTIZED KOLMOGOROV COMPLEXITY
The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantized Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties. We define the corresponding prefix complexity and show …