Skip navigation
Skip navigation

Algorithmic Complexity

Sunehag, Peter


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...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Book chapter
Book Title: International Encyclopedia of the Social & Behavioral Sciences (Second Edition)


File Description SizeFormat Image
01_Sunehag_Algorithmic_Complexity_2015.pdf241.74 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator