FIFTH system for general-purpose connectionist computation
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
An algorithm for the computation of joint Hawkes moments with exponential kernel
The purpose of this paper is to present a recursive algorithm and its implementation in Maple and Mathematica for the computation of joint moments and cumulants of Hawkes processes with exponential kernels. Numerical res…
Quantum Cybernetics and Complex Quantum Systems Science - A Quantum Connectionist Exploration
Quantum cybernetics and its connections to complex quantum systems science is addressed from the perspective of complex quantum computing systems. In this way, the notion of an autonomous quantum computing system is intr…
Small-footprint Keyword Spotting Using Deep Neural Network and Connectionist Temporal Classifier
Mainly for the sake of solving the lack of keyword-specific data, we propose one Keyword Spotting (KWS) system using Deep Neural Network (DNN) and Connectionist Temporal Classifier (CTC) on power-constrained small-footpr…
Decision MakingKeyword SpottingSmall-Footprint Keyword Spottingspeech-recognition+1A Short Survey of Systematic Generalization
This survey includes systematic generalization and a history of how machine learning addresses it. We aim to summarize and organize the related information of both conventional and recent improvements. We first look at t…
SurveySystematic GeneralizationVisual Question Answering (VQA)Learning Algebraic Representation for Systematic Generalization in Abstract Reasoning
Is intelligence realized by connectionist or classicist? While connectionist approaches have achieved superhuman performance, there has been growing evidence that such task-specific superiority is particularly fragile in…
Abstract AlgebraSystematic Generalization