About: A Computability Argument Against Superintelligence

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Computability Argument Against Superintelligence Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Using the contemporary view of computing exemplified by recent models and results from non-uniform complexity theory, we investigate the computational power of cognitive systems. We show that in accordance with the so-called extended Turing machine paradigm such systems can be modelled as non-uniform evolving interactive systems whose computational power surpasses that of the classical Turing machines. Our results show that there is an infinite hierarchy of cognitive systems. Within this hierarchy, there are systems achieving and surpassing the human intelligence level. Any intelligence level surpassing the human intelligence is called the superintelligence level. We will argue that, formally, from a computation viewpoint the human-level intelligence is upper-bounded by the class of the Arithmetical Hierarchy. In this class, there are problems whose complexity grows faster than any computable function and, therefore, not even exponential growth of computational power can help in solving such problems, or reach the level of superintelligence. Using the contemporary view of computing exemplified by recent models and results from non-uniform complexity theory, we investigate the computational power of cognitive systems. We show that in accordance with the so-called extended Turing machine paradigm such systems can be modelled as non-uniform evolving interactive systems whose computational power surpasses that of the classical Turing machines. Our results show that there is an infinite hierarchy of cognitive systems. Within this hierarchy, there are systems achieving and surpassing the human intelligence level. Any intelligence level surpassing the human intelligence is called the superintelligence level. We will argue that, formally, from a computation viewpoint the human-level intelligence is upper-bounded by the class of the Arithmetical Hierarchy. In this class, there are problems whose complexity grows faster than any computable function and, therefore, not even exponential growth of computational power can help in solving such problems, or reach the level of superintelligence. (en)
Title	A Computability Argument Against Superintelligence A Computability Argument Against Superintelligence (en)
skos:prefLabel	A Computability Argument Against Superintelligence A Computability Argument Against Superintelligence (en)
skos:notation	RIV/67985807:_____/12:00375042!RIV13-GA0-67985807
http://linked.open...avai/predkladatel	Ústav informatiky AV ČR, v.v.i.
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GAP202/10/1333), Z(AV0Z10300504)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Wiedermann, Jiří
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav informatiky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	120117
http://linked.open...ai/riv/idVysledku	RIV/67985807:_____/12:00375042
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	cognitive systems; intelligence; extended Turing machine thesis; singularity; superintelligence (en)
http://linked.open.../riv/klicoveSlovo	singularity extended Turing machine thesis superintelligence cognitive systems intelligence
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[01E3D3D779A4]
http://linked.open...i/riv/nazevZdroje	Cognitive Computation
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	4
http://linked.open...iv/tvurceVysledku	Wiedermann, Jiří
http://linked.open...ain/vavai/riv/wos	000308817500005
http://linked.open...n/vavai/riv/zamer	Informatika pro informační společnost: modely, algoritmy, aplikace
issn	1866-9956
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/s12559-012-9124-9
is http://linked.open...avai/riv/vysledek of	A Computability Argument Against Superintelligence

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software