Real-World Limits to Algorithmic Intelligence

  • Leo Pape
  • Arthur Kok
Conference paper

DOI: 10.1007/978-3-642-22887-2_49

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6830)
Cite this paper as:
Pape L., Kok A. (2011) Real-World Limits to Algorithmic Intelligence. In: Schmidhuber J., Thórisson K.R., Looks M. (eds) Artificial General Intelligence. AGI 2011. Lecture Notes in Computer Science, vol 6830. Springer, Berlin, Heidelberg


Recent theories of universal algorithmic intelligence, combined with the view that the world can be completely specified in mathematical terms, have led to claims about intelligence in any agent, including human beings. We discuss the validity of assumptions and claims made by theories of universally optimal intelligence in relation to their application in actual robots and intelligence tests. Our argument is based on an exposition of the requirements for knowledge of the world through observations. In particular, we will argue that the world can only be known through the application of rules to observations, and that beyond these rules no knowledge can be obtained about the origin of our observations. Furthermore, we expose a contradiction in the assumption that it is possible to fully formalize the world, as for example is done in digital physics, which can therefore not serve as the basis for any argument or proof about algorithmic intelligence that interacts with the world.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Leo Pape
    • 1
  • Arthur Kok
    • 2
  1. 1.IDSIAUniversity of LuganoManno-LuganoSwitzerland
  2. 2.Tilburg UniversityTilburgThe Netherlands

Personalised recommendations