Constant compression and random weights

DOI10.4230/LIPICS.STACS.2012.172MaRDI QIDQ2904759zbMATH OpenOpenAlexFDO

Authors Wolfgang Merkle, Jason Teutsch

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2012.172

zbMATH Keywords

algorithmic randomnesscomputational complexityKolmogorov complexityOmega number

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Constant compression and random weights
• Computing a Glimpse of Randomness
• A Chaitin number based on compressible strings
• A new representation of Chaitin \(\Omega \) number based on compressible strings
• Chaitin numbers and halting problems

Cited in

(3)

• A Chaitin number based on compressible strings
• A new representation of Chaitin \(\Omega \) number based on compressible strings
• Constant compression and random weights

This page was built for publication: Constant compression and random weights

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