首页> 外文会议>IEEE Symposium Series on Computational Intelligence >Maximal Algorithmic Caliber and Algorithmic Causal Network Inference: General Principles of Real-World General Intelligenceƒ
【24h】

Maximal Algorithmic Caliber and Algorithmic Causal Network Inference: General Principles of Real-World General Intelligenceƒ

机译:最大算法口径和因果网络推论:真实世界通用情报的一般原则

获取原文

摘要

Ideas and formalisms from far-from-equilibrium thermodynamics are ported to the context of stochastic computational processes, via following and extending Tadaki’s algorithmic thermodynamics. A Principle of Maximum Algorithmic Caliber is proposed, providing guidance as to what computational processes one should hypothesize if one is provided constraints to work within. It is conjectured that, under suitable assumptions, computational processes obeying algorithmic Markov conditions will maximize algorithmic caliber. It is proposed that in accordance with this, real-world cognitive systems may operate in substantial part by modeling their environments and choosing their actions to be (approximate and compactly represented) algorithmic Markov networks. These ideas are suggested as potential early steps toward a general theory of the operation of pragmatic generally intelligent systems.
机译:通过跟踪和扩展Tadaki的算法热力学,将非平衡热力学的思想和形式主义移植到随机计算过程的上下文中。提出了“最大算法口径”原理,为如果提供了在其中工作的约束条件,应假定的计算过程提供了指导。据推测,在适当的假设下,服从算法马尔可夫条件的计算过程将使算法口径最大化。据此提出,现实世界的认知系统可以通过对环境进行建模并选择其动作作为(近似和紧凑表示的)算法马尔可夫网络来在很大程度上进行操作。这些想法被认为是迈向实用的通用智能系统的一般理论的潜在早期步骤。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号