Skip to main content

An Information Theoretic Representation of Agent Dynamics as Set Intersections

  • Conference paper
Artificial General Intelligence (AGI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6830))

Included in the following conference series:

Abstract

We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as the intersection of their respective strings, we prove complexity properties of player interactions using Algorithmic Information Theory. We show how the proposed construction is compatible with Universal Artificial Intelligence, in that the AIXI model can be seen as universal with respect to interaction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cover, T., Thomas, J.: Elements of Information Theory. Wiley-Interscience, New York (1991)

    Book  MATH  Google Scholar 

  2. Goertzel, B., Pennachin, C.: Artificial General Intelligence (Cognitive Technologies). Springer-Verlag New York, Inc., Secaucus (2007)

    Book  Google Scholar 

  3. Gács, P., Tromp, J., Vitanyi, P.: Algorithmic Statistics. IEEE Transactions on Information Theory 47(6) (2001)

    Google Scholar 

  4. Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin (2004)

    Google Scholar 

  5. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer Publishing Company, Incorporated, Heidelberg (2008)

    Book  MATH  Google Scholar 

  6. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall, Englewood Cliffs (2009)

    Google Scholar 

  7. Vereshchagin, N., Vitányi, P.: Algorithmic Rate Distortion Theory. arXiv:cs/0411014v3 (2004), http://arxiv.org/abs/cs.IT/0411014

  8. Vereshchagin, N., Vitányi, P.: Rate Distortion and Denoising of Individual Data using Kolmogorov Complexity. IEEE Transactions on Information Theory 56 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, S., Betke, M. (2011). An Information Theoretic Representation of Agent Dynamics as Set Intersections. 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. https://doi.org/10.1007/978-3-642-22887-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22887-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22886-5

  • Online ISBN: 978-3-642-22887-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics