License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2018.5
URN: urn:nbn:de:0030-drops-88982
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8898/
Go to the corresponding LIPIcs Volume Portal

Häggström, Olle

Thinking in Advance About the Last Algorithm We Ever Need to Invent (Keynote Speakers)

pdf-format:
LIPIcs-AofA-2018-5.pdf (0.3 MB)

Abstract

We survey current discussions about possibilities and risks associated with an artificial intelligence breakthrough on the level that puts humanity in the situation where we are no longer foremost on the planet in terms of general intelligence. The importance of thinking in advance about such an event is emphasized. Key issues include when and how suddenly superintelligence is likely to emerge, the goals and motivations of a superintelligent machine, and what we can do to improve the chances of a favorable outcome.

BibTeX - Entry

@InProceedings{hggstrm:LIPIcs:2018:8898,
  author =	{Olle H{\"a}ggstr{\"o}m},
  title =	{{Thinking in Advance About the Last Algorithm We Ever Need to Invent (Keynote Speakers)}},
  booktitle =	{29th International Conference on Probabilistic,  Combinatorial and Asymptotic Methods for the Analysis of Algorithms  (AofA 2018)},
  pages =	{5:1--5:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-078-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{110},
  editor =	{James Allen Fill and Mark Daniel Ward},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8898},
  URN =		{urn:nbn:de:0030-drops-88982},
  doi =		{10.4230/LIPIcs.AofA.2018.5},
  annote =	{Keywords: intelligence explosion, Omohundro-Bostrom theory, superintelligence}
}

Keywords: intelligence explosion, Omohundro-Bostrom theory, superintelligence
Collection: 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Issue Date: 2018
Date of publication: 18.06.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI