281 citations
- University of AmsterdamNL23 papers
- Eindhoven University of TechnologyNL17 papers
- College of Western IdahoUS5 papers
- Universidad Pública de Navarra (UPNA)ES4 papers
- University of WaterlooCA4 papers
- Vrije Universiteit AmsterdamNL4 papers
- Berkeley CollegeUS2 papers
- National University of SingaporeSG2 papers
- Radboud University NijmegenNL2 papers
- University of BristolGB2 papers
- University of California, BerkeleyUS2 papers
- University of CambridgeGB2 papers
Showing 2008 · cs.CCShow all
2 papers · 2 filters
cs.CC2008
Depth as Randomness Deficiency
Luis Antunes, Armando Matos, Andre Souto +1
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an uncondition…
cs.CC2008★ 1 cited
Kolmogorov Complexity Theory over the Reals
Martin Ziegler, Wouter M. Koolen
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing ma…