Kolmogorov Complexity Theory over the Reals

Details Kolmogorov Complexity Theory over the Reals Kolmogorov Complexity Theory over the Reals

2008-02-14

arxiv.org/abs/0802.2027v2

Computer Science

Computational Complexity

Scientific paper

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) has been established as a major model of computation. This real realm has turned out to exhibit natural counterparts to many notions and results in classical complexity and recursion theory; although usually with considerably different proofs. The present work investigates similarities and differences between discrete and real Kolmogorov Complexity as introduced by Montana and Pardo (1998).

Affiliated with

Also associated with

No associations

Rating

Kolmogorov Complexity Theory over the Reals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kolmogorov Complexity Theory over the Reals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolmogorov Complexity Theory over the Reals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682620