On Super-Turing Computing Power and Hierarchies of Artificial General Intelligence Systems
Available Online June 2010.
- https://doi.org/10.2991/agi.2010.6How to use a DOI?
- Using the contemporary view of computing exemplified by recent models and results from non-uniform complexity theory we investigate the computational power of artificial general intelligence systems (AGISs). We show that in accordance with the so-called Extended Turing Machine Paradigm such systems can be seen as non-uniform evolving interactive systems whose computational power surpasses that of classical Turing machines. Our results shed light to the question asked by R. Penrose concerning the mathematical capabilities of human mathematicians which seem to go beyond classical computability. We also show that there is an infinite hierarchy of AGISs each of which is capable to solve strictly more problems than its predecessors in the hierarchy. Characterizing the Computational Properties of AGISs.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Jiri Wiedermann PY - 2010/06 DA - 2010/06 TI - On Super-Turing Computing Power and Hierarchies of Artificial General Intelligence Systems BT - 3d Conference on Artificial General Intelligence (AGI-2010) PB - Atlantis Press SP - 27 EP - 28 SN - 1951-6851 UR - https://doi.org/10.2991/agi.2010.6 DO - https://doi.org/10.2991/agi.2010.6 ID - Wiedermann2010/06 ER -