Constant compression and random weights

DOI10.3233/COM-12011MaRDI QIDQ4904464zbMATH OpenOpenAlexFDO

Authors Wolfgang Merkle, Jason Teutsch

Publication date 30 January 2013

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-12011

zbMATH Keywords

Kolmogorov complexityalgorithmic randomnessOmega numberscompressible stringsTheta number

Mathematics Subject Classification ID

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

Recommendations

• Constant compression and random weights
• A Chaitin number based on compressible strings
• A new representation of Chaitin \(\Omega \) number based on compressible strings
• Randomness and universal machines
• EXACT APPROXIMATIONS OF OMEGA NUMBERS

Cited in

(6)

• Randomness and universal machines
• Constant compression and random weights
• A Chaitin number based on compressible strings
• Things that can be made into themselves
• Chaitin's halting probability and the compression of strings using oracles
• A new representation of Chaitin \(\Omega \) number based on compressible strings

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 Q4904464)