Superintelligence cannot be contained: Lessons from Computability Theory. Alfonseca, M., Cebrian, M., Anta, A. F., Coviello, L., Abeliuk, A., & Rahwan, I. 2016. cite arxiv:1607.00913Comment: 7 pages, 5 figuresabstract bibtex Superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. In light of recent advances in machine intelligence, a number of scientists, philosophers and technologists have revived the discussion about the potential catastrophic risks entailed by such an entity. In this article, we trace the origins and development of the neo-fear of superintelligence, and some of the major proposals for its containment. We argue that such containment is, in principle, impossible, due to fundamental limits inherent to computing itself. Assuming that a superintelligence will contain a program that includes all the programs that can be executed by a universal Turing machine on input potentially as complex as the state of the world, strict containment requires simulations of such a program, something theoretically (and practically) infeasible.
@article{alfonseca2016superintelligence,
abstract = {Superintelligence is a hypothetical agent that possesses intelligence far
surpassing that of the brightest and most gifted human minds. In light of
recent advances in machine intelligence, a number of scientists, philosophers
and technologists have revived the discussion about the potential catastrophic
risks entailed by such an entity. In this article, we trace the origins and
development of the neo-fear of superintelligence, and some of the major
proposals for its containment. We argue that such containment is, in principle,
impossible, due to fundamental limits inherent to computing itself. Assuming
that a superintelligence will contain a program that includes all the programs
that can be executed by a universal Turing machine on input potentially as
complex as the state of the world, strict containment requires simulations of
such a program, something theoretically (and practically) infeasible.},
added-at = {2018-01-23T06:29:14.000+0100},
author = {Alfonseca, Manuel and Cebrian, Manuel and Anta, Antonio Fernandez and Coviello, Lorenzo and Abeliuk, Andres and Rahwan, Iyad},
biburl = {https://www.bibsonomy.org/bibtex/29f4d093670f64a14d5beab8f788bb2bc/esmaeel.bandar},
description = {Superintelligence cannot be contained: Lessons from Computability Theory},
interhash = {921468c3408aa184ddd7c6a9367c77a9},
intrahash = {9f4d093670f64a14d5beab8f788bb2bc},
keywords = {computability theory},
note = {cite arxiv:1607.00913Comment: 7 pages, 5 figures},
timestamp = {2018-01-23T06:30:26.000+0100},
title = {Superintelligence cannot be contained: Lessons from Computability Theory},
howpublished = {http://arxiv.org/abs/1607.00913},
year = 2016
}
Downloads: 0
{"_id":"Mspv8H2ihpyEEM9xJ","bibbaseid":"alfonseca-cebrian-anta-coviello-abeliuk-rahwan-superintelligencecannotbecontainedlessonsfromcomputabilitytheory-2016","authorIDs":[],"author_short":["Alfonseca, M.","Cebrian, M.","Anta, A. F.","Coviello, L.","Abeliuk, A.","Rahwan, I."],"bibdata":{"bibtype":"article","type":"article","abstract":"Superintelligence is a hypothetical agent that possesses intelligence far surpassing that of the brightest and most gifted human minds. In light of recent advances in machine intelligence, a number of scientists, philosophers and technologists have revived the discussion about the potential catastrophic risks entailed by such an entity. In this article, we trace the origins and development of the neo-fear of superintelligence, and some of the major proposals for its containment. We argue that such containment is, in principle, impossible, due to fundamental limits inherent to computing itself. Assuming that a superintelligence will contain a program that includes all the programs that can be executed by a universal Turing machine on input potentially as complex as the state of the world, strict containment requires simulations of such a program, something theoretically (and practically) infeasible.","added-at":"2018-01-23T06:29:14.000+0100","author":[{"propositions":[],"lastnames":["Alfonseca"],"firstnames":["Manuel"],"suffixes":[]},{"propositions":[],"lastnames":["Cebrian"],"firstnames":["Manuel"],"suffixes":[]},{"propositions":[],"lastnames":["Anta"],"firstnames":["Antonio","Fernandez"],"suffixes":[]},{"propositions":[],"lastnames":["Coviello"],"firstnames":["Lorenzo"],"suffixes":[]},{"propositions":[],"lastnames":["Abeliuk"],"firstnames":["Andres"],"suffixes":[]},{"propositions":[],"lastnames":["Rahwan"],"firstnames":["Iyad"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/29f4d093670f64a14d5beab8f788bb2bc/esmaeel.bandar","description":"Superintelligence cannot be contained: Lessons from Computability Theory","interhash":"921468c3408aa184ddd7c6a9367c77a9","intrahash":"9f4d093670f64a14d5beab8f788bb2bc","keywords":"computability theory","note":"cite arxiv:1607.00913Comment: 7 pages, 5 figures","timestamp":"2018-01-23T06:30:26.000+0100","title":"Superintelligence cannot be contained: Lessons from Computability Theory","howpublished":"http://arxiv.org/abs/1607.00913","year":"2016","bibtex":"@article{alfonseca2016superintelligence,\n abstract = {Superintelligence is a hypothetical agent that possesses intelligence far\nsurpassing that of the brightest and most gifted human minds. In light of\nrecent advances in machine intelligence, a number of scientists, philosophers\nand technologists have revived the discussion about the potential catastrophic\nrisks entailed by such an entity. In this article, we trace the origins and\ndevelopment of the neo-fear of superintelligence, and some of the major\nproposals for its containment. We argue that such containment is, in principle,\nimpossible, due to fundamental limits inherent to computing itself. Assuming\nthat a superintelligence will contain a program that includes all the programs\nthat can be executed by a universal Turing machine on input potentially as\ncomplex as the state of the world, strict containment requires simulations of\nsuch a program, something theoretically (and practically) infeasible.},\n added-at = {2018-01-23T06:29:14.000+0100},\n author = {Alfonseca, Manuel and Cebrian, Manuel and Anta, Antonio Fernandez and Coviello, Lorenzo and Abeliuk, Andres and Rahwan, Iyad},\n biburl = {https://www.bibsonomy.org/bibtex/29f4d093670f64a14d5beab8f788bb2bc/esmaeel.bandar},\n description = {Superintelligence cannot be contained: Lessons from Computability Theory},\n interhash = {921468c3408aa184ddd7c6a9367c77a9},\n intrahash = {9f4d093670f64a14d5beab8f788bb2bc},\n keywords = {computability theory},\n note = {cite arxiv:1607.00913Comment: 7 pages, 5 figures},\n timestamp = {2018-01-23T06:30:26.000+0100},\n title = {Superintelligence cannot be contained: Lessons from Computability Theory},\n howpublished = {http://arxiv.org/abs/1607.00913},\n year = 2016\n}\n\n","author_short":["Alfonseca, M.","Cebrian, M.","Anta, A. F.","Coviello, L.","Abeliuk, A.","Rahwan, I."],"bibbaseid":"alfonseca-cebrian-anta-coviello-abeliuk-rahwan-superintelligencecannotbecontainedlessonsfromcomputabilitytheory-2016","role":"author","urls":{},"keyword":["computability theory"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/f/Bfi3yYPxhtyKncP4R/aabeliuk-isi-edu.bib","creationDate":"2020-02-03T23:48:58.458Z","downloads":0,"keywords":["computability theory"],"search_terms":["superintelligence","contained","lessons","computability","theory","alfonseca","cebrian","anta","coviello","abeliuk","rahwan"],"title":"Superintelligence cannot be contained: Lessons from Computability Theory","year":2016,"dataSources":["qXmB8Cnrcvx883Fwx","efWerWm2QPDBjueMK","FSoKwX2WQoR9zQsgd"]}