A general notion of useful information

MaRDI QIDQ5145158zbMATH OpenFDO

Authors Philippe Moser

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3186, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CSP08.16

Mathematics Subject Classification ID

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

Recommendations

• On the polynomial depth of various sets of random strings
• Recursive computational depth
• Recursive computational depth.
• Depth as randomness deficiency
• Information measures for infinite sequences

Cited in

(3)

• On the polynomial depth of various sets of random strings
• Unpredictability and computational irreducibility
• Useful information and questionnaires

This page was built for publication: A general notion of useful information

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