Guest! Login/Join

DomainTools.com


 
Language:
  EN  
  DE  
  FR  
  ES  
  IT  
  JA  
  NL  
  PL  
  PT  
  RU  
  SV  
  ZH  
Domains:
11
0
0
0
0
0
0
0
0
0
0
0

Kolmogorov complexity references on wikipedia


Kolmogorov_complexity
algorithmic information theory (a subfield of computer science), the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov-Chaitin complexity, stochastic complexity, algorithmic entropy, or program-size complexity) of an object such as a piece of text is a measure of the computational resources needed to specify the object. For example, consider the following two strings of length 64, each containing only lowercase letters, numbers, and spaces

Domain Referenced Description
AU: Velkommen til Aarhus Universitet Au.dkAU: Velkommen til Aarhus Universitet

Centrum Wiskunde & Informatica | CWI Cwi.nlCentrum Wiskunde & Informatica | CWI

Internet FAQ Archives - Online Education Faqs.orgInternet FAQ Archives - Online Education

IDSIA - Dalle Molle Institute for Artificial Intelligence Idsia.chIDSIA - Dalle Molle Institute for Artificial Intelligence

Kolmogorov Kolmogorov.comKolmogorov

MIT Mit.eduMIT

Monash University Monash.edu.auMonash University

Oxford University Press - OUP - UK Official Home Page of Oxford University Press - Oxford Books Oup.co.ukOxford University Press - OUP - UK Official Home Page of Oxford University Press - Oxford Books

Welcome to Penn State s Home on the Web Psu.eduWelcome to Penn State s Home on the Web

www.TheWorld.com: The World s Home Page Std.comwww.TheWorld.com: The World s Home Page

The University of Maine - The University of Maine - Umaine.eduThe University of Maine - The University of Maine -