Superintelligence Cannot be Contained: Lessons from Computability Theory

DOI10.1613/jair.1.12202zbMath1497.68408arXiv1607.00913OpenAlexW2463389769WikidataQ130952543 ScholiaQ130952543MaRDI QIDQ5145835

Manuel Alfonseca, Iyad Rahwan, Manuel Cebrian, Antonio Fernández Anta, Andrés Abeliuk, Lorenzo Coviello

Publication date: 22 January 2021

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.00913

zbMATH Keywords

mathematical foundationsphilosophical foundationscomputational social systems

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• Unnamed Item
• Checkers Is Solved
• A probabilistic anytime algorithm for the halting problem
• On Non-Computable Functions
• Fundamentals of Computation Theory
• An Unsolvable Problem of Elementary Number Theory
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Deep Blue

This page was built for publication: Superintelligence Cannot be Contained: Lessons from Computability Theory