Unpredictable strings are collectives

DOI10.1016/0097-3165(89)90089-7MaRDI QIDQ1120569zbMATH OpenOpenAlexFDO

Authors Moshe Koppel

Publication date 1989

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(89)90089-7

zbMATH Keywords

collectivesinductive inferenceunpredictable strings

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Review text

The author previously defined the notion of an ``inference method which given a finite binary string guesses its continuation. He showed that a special class of these methods could be used to construct a very general theory of confirmation. In this paper the author investigates the class of strings which are unpredictable with respect to these inference methods, that is, infinite strings for which, given any initial segment, a given inference method will guess its continuation incorrectly. It is shown that such unpredictable strings are also what von Mises called ``collectives (where the ambiguity in von Mises' definition is appropriately resolved). Thus strings which are unpredictable are also statistically random.

Recommendations

• Unpredictable strings
• scientific article; zbMATH DE number 4135865
• How many strings are easy to predict?
• How many strings are easy to predict?
• scientific article; zbMATH DE number 93941

Cites work

• scientific article; zbMATH DE number 3132222 (Why is no real title available?)
• scientific article; zbMATH DE number 221554 (Why is no real title available?)
• Towards a new theory of confirmation

Cited in

(1)

• Unpredictable strings

This page was built for publication: Unpredictable strings are collectives

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