Index Terms
- Introduction to the Theory of Computation
Recommendations
Kolmogorov Complexity Theory over the Reals
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory-in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) ...
Comments