FORMAL THEORY OF INDUCTIVE INFERENCE .2
FORMAL THEORY OF INDUCTIVE INFERENCE .2
复制标题
DOI：
10.1016/s0019-9958(64)90131-7
复制
发表时间：
1964-01-01
影响因子：
--
通讯作者：
SOLOMONOFF, RJ
中科院分区：
文献类型：
--
作者：
SOLOMONOFF, RJ
第4.1节讨论伯努利序列。所得结果与”拉普拉斯继承法则“的结果一致。一个特别重要的技术是将原始序列编码成一组整数，这些整数构成了4.2节和4.3节中问题的”描述”。4.2节讨论的是存在某种符号间约束的序列的外推。这种序列的代码是通过为频率异常高或低的被测者定义特殊符号来设计的。这种编码方法的一些性质进行了讨论，他们被发现是直观合理的。初步的计算机程序已被写入使用这种编码方法的感应。然而，程序中使用了一些重要的简化，它是否能做出有用的预测还不确定。
Section 4.1 deals with the Bernoulli sequence. The predictions obtained are identical to those given by" Laplace's Rule of Succession." A particularly important technique is used to code the original sequence into a set of integers which constitute its" descriptions" for the problems of Sections 4.2 and 4.3.Section 4.2 deals with the extrapolation of a sequence in which there are certain kinds of intersymbol constraints. Codes for such sequences are devised by defining special symbols for subsequenees whose frequencies are unusually high or low. Some properties of this coding method are discussed, and they are found to be intuitively reasonable. A preliminary computer program has been written for induction using this coding method. However, there are some important simplifications used in the program, and it is uncertain as to whether it can make useful predictions.