The reviewed record of science sign in
Pith

arxiv: 1607.00913 · v1 · pith:W5EBS3PH · submitted 2016-07-04 · cs.CY · cs.AI

Superintelligence cannot be contained: Lessons from Computability Theory

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:W5EBS3PHrecord.jsonopen to challenge →

classification cs.CY cs.AI
keywords superintelligencecontainmentintelligencemachineprogramadvancesagentargue
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Safety from Honesty in a Disinterested AI Predictor

    cs.AI 2026-06 unverdicted novelty 6.0

    A disinterested Bayesian Predictor trained on contextualized statements has low probability of producing harmful agency because dangerous behaviors require rare coordinated underestimation of harm with no training sig...