Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Relative Kolmogorov complexity and geometry

From MaRDI portal
Publication:3107351
Jump to:navigation, search

DOI10.2178/JSL/1318338846zbMath1247.03084OpenAlexW2118939184MaRDI QIDQ3107351

Stephen Binns

Publication date: 23 December 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1318338846


zbMATH Keywords

Kolmogorov complexitycompressibilityeffective dimensioninfinite binary sequencesgeometric concepts


Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)


Related Items (2)

Compressibility and Kolmogorov complexity ⋮ Completeness, Compactness, Effective Dimensions




Cites Work

  • Unnamed Item
  • A Kolmogorov complexity characterization of constructive Hausdorff dimension.
  • The dimensions of individual strings and sequences
  • Effective fractal dimensions
  • Algorithmic Randomness and Complexity
  • Effective Strong Dimension in Algorithmic Information and Computational Complexity




This page was built for publication: Relative Kolmogorov complexity and geometry

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3107351&oldid=16185591"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki