Shift-complex sequences

DOI10.2178/bsl.1902020zbMath1285.03057OpenAlexW2156472123MaRDI QIDQ5300087

Mushfeq Khan

Publication date: 24 June 2013

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

Full work available at URL: https://projecteuclid.org/euclid.bsl/1368716900

zbMATH Keywords

Kolmogorov complexitysubshiftsMartin-Löf randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (2)

DEEP CLASSES ⋮ Diagonally non-computable functions and fireworks

Cites Work

• Unnamed Item
• Extracting Kolmogorov complexity with applications to dimension zero-one laws
• Degrees of difficulty of generalized r.e. separating classes
• A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
• Difference randomness
• Algorithmic Randomness and Complexity
• Complex tilings
• Diagonally non-recursive functions and effective Hausdorff dimension
• FORCING WITH BUSHY TREES
• Two notes on subshifts
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences

This page was built for publication: Shift-complex sequences