Computational geometry: an introduction
Computational geometry: an introduction
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Computing over the reals with addition and order: higher complexity classes
Journal of Complexity
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Complexity and real computation
Complexity and real computation
On Kolmogorov complexity in the real Turing machine setting
Information Processing Letters
Theoretical Computer Science - Special issue on computability and complexity in analysis
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
Theoretical Computer Science - Special issue on universal machines and computations
Counting problems over the reals
Theoretical Computer Science
Cook's versus Valiant's hypothesis
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
The Theory of Computation
Transparent Long Proofs: A First PCP Theorem for NPR
Foundations of Computational Mathematics
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
An explicit solution to Post's Problem over the reals
Journal of Complexity
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
VPSPACE and a transfer theorem over the reals
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the Kolmogorov complexity of continuous real functions
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
| Hi-index | 0.00 |
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).