Ultimate Intelligence Part II: Physical Complexity and Limits of Inductive Inference Systems

被引:0
|
作者
Ozkural, Eray [1 ]
机构
[1] Gok Us Sibernet Ar & Ge Ltd, Istanbul, Turkey
关键词
CONVERGENCE THEOREMS; FORMAL THEORY;
D O I
10.1007/978-3-319-41649-6_4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We continue our analysis of volume and energy measures that are appropriate for quantifying inductive inference systems. We extend logical depth and conceptual jump size measures in AIT to stochastic problems, and physical measures that involve volume and energy. We introduce a graphical model of computational complexity that we believe to be appropriate for intelligent machines. We show several asymptotic relations between energy, logical depth and volume of computation for inductive inference. In particular, we arrive at a "black-hole equation" of inductive inference, which relates energy, volume, space, and algorithmic information for an optimal inductive inference solution. We introduce energy-bounded algorithmic entropy. We briefly apply our ideas to the physical limits of intelligent computation in our universe.
引用
收藏
页码:33 / 42
页数:10
相关论文
共 31 条