arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.00002cs.AI
收藏

用于通用连接主义计算的FIFTH系统

FIFTH system for general-purpose connectionist computation

Anthony Di Franco

摘要:

到目前为止,以至少是图灵完备的方式形式化连接主义计算的工作集中在递归架构上,并开发了与图灵机或类似的超级图灵模型的等价物,这些模型的理论意义大于实际意义。相反,我们开发的连接主义计算的信息传播网络扩展与无界递归,这是有关的约束逻辑编程的框架内,是更多的声明比通常用于实际编程中的语义,但仍然正式称为图灵完备。这种方法对连接主义计算和程序设计语言的理论和实践都有贡献。连接主义计算是以一种允许它们与通用程序设计语言的高级语义直接通信、理解和询问的方式进行的。与此同时,困难的(无界维,NP难)搜索问题的编程,以前已经留给程序员解决的启发式,域特定的方式是解决一致的先验的方式,大约达到信息理论的性能限制。

英文摘要:

To date, work on formalizing connectionist computation in a way that is at least Turing-complete has focused on recurrent architectures and developed equivalences to Turing machines or similar super-Turing models, which are of more theoretical than practical significance. We instead develop connectionist computation within the framework of information propagation networks extended with unbounded recursion, which is related to constraint logic programming and is more declarative than the semantics typically used in practical programming, but is still formally known to be Turing-complete. This approach yields contributions to the theory and practice of both connectionist computation and programming languages. Connectionist computations are carried out in a way that lets them communicate with, and be understood and interrogated directly in terms of the high-level semantics of a general-purpose programming language. Meanwhile, difficult (unbounded-dimension, NP-hard) search problems in programming that have previously been left to the programmer to solve in a heuristic, domain-specific way are solved uniformly a priori in a way that approximately achieves information-theoretic limits on performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑