IEEE/CAA Journal of Automatica Sinica · 2016 · 338 citations · 19 references
ComputingComputer ScienceAlgorithmsArtificial IntelligenceMachine LearningChurch-turing ThesisComputational ModelsDeep LearningExpert SystemsNeural NetworksParallel ArchitecturesComplexity-theoretic Church-turing ThesisDecision ProblemsIntelligent ControlMachine IntelligenceOptimization Of Complex SystemsSoundness
An investigation on the impact and significance of the AlphaGo vs. Lee Sedol Go match is conducted, and concludes with a conjecture of the AlphaGo Thesis and its extension in accordance with the Church-Turing Thesis in the history of computing. It is postulated that the architecture and method utilized by the AlphaGo program provide an engineering solution for tackling issues in complexity and intelligence. Specifically, the AlphaGo Thesis implies that any effective procedure for hard decision problems such as NP-hard can be implemented with AlphaGo-like approach. Deep rule-based networks are proposed in attempt to establish an understandable structure for deep neural networks in deep learning. The success of AlphaGo and corresponding thesis ensure the technical soundness of the parallel intelligence approach for intelligent control and management of complex systems and knowledge automation.
19
Mastering the game of Go with deep neural networks and tree search
David Silver, Aja Huang, Chris J. Maddison et al. · Nature · 2016 · 15.8K citations
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Finite Automata and Their Decision Problems
M. O. Rabin, D. Scott · IBM Journal of Research and Development · 1959 · 1.9K citations
Training a 3-node neural network is NP-complete
Avrim Blum, Ronald L. Rivest · Neural Networks · 1992 · 549 citations