December 2011 Relative Kolmogorov complexity and geometry
Stephen Binns
J. Symbolic Logic 76(4): 1211-1239 (December 2011). DOI: 10.2178/jsl/1318338846

Abstract

We use the notions of effective dimension and Kolmogorov complexity to describe a geometry on the set of infinite binary sequences. Geometric concepts that we define and use include angle, projections and scalar multiplication. A question related to compressibility is addressed using these ideas.

Citation

Download Citation

Stephen Binns. "Relative Kolmogorov complexity and geometry." J. Symbolic Logic 76 (4) 1211 - 1239, December 2011. https://doi.org/10.2178/jsl/1318338846

Information

Published: December 2011
First available in Project Euclid: 11 October 2011

zbMATH: 1247.03084
MathSciNet: MR2895393
Digital Object Identifier: 10.2178/jsl/1318338846

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
29 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.76 • No. 4 • December 2011
Back to Top