Algorithmic Complexity

Peter Sunehag, Marcus Hutter

    Research output: Chapter in Book/Report/Conference proceedingEntry for encyclopedia/dictionarypeer-review

    Abstract

    Algorithmic complexity provides a mathematical formal notion of string complexity. Building on this, one arrives at mathematical gold standard (though incomputable) definitions of randomness, induction, similarity, and even intelligence. These definitions can be turned into practical algorithms by using common compressors to approximate the universal solutions. One can consider the theories as idealized cognition with respect to which one can aim to describe actual biological cognition by listing biases and limitations that need to be defined relative to some normative reference.
    Original languageEnglish
    Title of host publicationInternational Encyclopedia of the Social & Behavioral Sciences (Second Edition)
    EditorsJames D Wright
    Place of PublicationOxford
    PublisherElsevier
    Pages534-538pp
    Volume26
    Edition2nd
    ISBN (Print)9780080970875
    Publication statusPublished - 2015

    Fingerprint

    Dive into the research topics of 'Algorithmic Complexity'. Together they form a unique fingerprint.

    Cite this