A Computability Argument Against Superintelligence
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F12%3A00375042" target="_blank" >RIV/67985807:_____/12:00375042 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s12559-012-9124-9" target="_blank" >http://dx.doi.org/10.1007/s12559-012-9124-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s12559-012-9124-9" target="_blank" >10.1007/s12559-012-9124-9</a>
Alternative languages
Result language
angličtina
Original language name
A Computability Argument Against Superintelligence
Original language 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 solvin
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F10%2F1333" target="_blank" >GAP202/10/1333: NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Cognitive Computation
ISSN
1866-9956
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
236-245
UT code for WoS article
000308817500005
EID of the result in the Scopus database
—