Shift-complex sequences

DOI10.2178/BSL.1902020MaRDI QIDQ5300087zbMATH OpenOpenAlexFDO

Authors 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 complexityMartin-Löf randomnesssubshifts

Mathematics Subject Classification ID

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

Recommendations

• Randomness for computable measures and initial segment complexity
• Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
• Everywhere complex sequences and the probabilistic method
• Statistical properties of finite sequences with high Kolmogorov complexity
• Every 2-random real is Kolmogorov random

Cites work

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

Cited in

(4)

• Shifted Appell sequences in Clifford analysis
• Adding a complex shift to HVPT
• Diagonally non-computable functions and fireworks
• Deep _1⁰ classes

This page was built for publication: Shift-complex sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300087)