Descriptive complexity | Computational complexity theory | Measures of complexity | Computability theory | Algorithmic information theory | Information theory
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy. It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory. The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem.In particular, no program P computing a lower bound for each text's Kolmogorov complexity can return a value essentially larger than P's own length (see section ); hence no single program can compute the exact Kolmogorov complexity for infinitely many texts. (Wikipedia).
Kolmogorov Complexity - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Randomness and Kolmogorov Complexity
What does it mean for something to be "random"? We might have an intuitive idea for what randomness looks like, but can we be a bit more precise about our definition for what we would consider to be random? It turns out there are multiple definitions for what's random and what isn't, but a
From playlist Spanning Tree's Most Recent
Kolmogorov Complexity Solution - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Laura Grigori: Challenges in achieving scalable and robust linear solvers
This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synch
From playlist Numerical Analysis and Scientific Computing
Unpredictability - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Amir Ali Ahmadi, Princeton University
January 31, Amir Ali Ahmadi, Princeton University Two Problems at the Interface of Optimization and Dynamical Systems We propose and/or analyze semidefinite programming-based algorithms for two problems at the interface of optimization and dynamical systems: In part (i), we study the po
From playlist Spring 2020 Kolchin Seminar in Differential Algebra
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity - Sergey Yekhanin
Sergey Yekhanin Microsoft Research March 31, 2015 A square matrix VV is called rigid if every matrix obtained by altering a small number of entries of VV has sufficiently high rank. While random matrices are rigid with high probability, no explicit constructions of rigid matrices are know
From playlist Mathematics
Clojure Conj 2012 - Whence Complexity?
Whence Complexity? by: Michael Nygard Quantum Mechanics and General Relativity don't agree on much, but both claim that every physical process is perfectly reversible. The Second Law of Themodynamics says, "Not likely!" The Second Law may win in the long run, but today, at (nearly) every
From playlist Clojure Conf 2012
Russian Multiplication Algorithm - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Andreï Kolmogorov: un grand mathématicien au coeur d'un siècle tourmenté
Conférence grand public au CIRM Luminy Andreï Kolmogorov est un mathématicien russe (1903-1987) qui a apporté des contributions frappantes en théorie des probabilités, théorie ergodique, turbulence, mécanique classique, logique mathématique, topologie, théorie algorithmique de l'informati
From playlist OUTREACH - GRAND PUBLIC
Nexus Trimester - Andrei Romashchenko (LIRMM)
On Parallels Between Shannon’s and Kolmogorov’s Information Theories (where the parallelism fails and why) Andrei Romashchenko (LIRMM) February 02, 2016 Abstract: Two versions of information theory - the theory of Shannon's entropy and the theory of Kolmgorov complexity - have manifest
From playlist Nexus Trimester - 2016 - Distributed Computation and Communication Theme
Order, disorder and entropy (Lecture - 01) by Daan Frenkel
INFOSYS-ICTS CHANDRASEKHAR LECTURES FROM SELF-ASSEMBLY TO CELL RECOGNITION Daan Frenkel (University of Cambridge, UK) DATE :29 August 2018, 16:00 to 17:00 VENUE:Ramanujan Lecture Hall, ICTS Bangalore. Lecture 1: Tuesday 28 August, 16:00 to 17:00 Title : Order, disorder and entropy Ab
From playlist Infosys-ICTS Chandrasekhar Lectures
Nexus Trimester - Alexander Shen (LIRMM, Montpellier) 2/2
Different versions of Kolmogorov complexity and a priori probability: a gentle introduction Alexander Shen (LIRMM, Montpellier) February 01, 2016 Abstract: The informal idea – the complexity is the minimal number of bits needed to describe the object – has several different implementatio
From playlist Nexus Trimester - 2016 - Distributed Computation and Communication Theme
Nicola Garofalo: Hypoelliptic operators and analysis on Carnot-Carathéodory spaces
Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities: - Chapter markers and keywords to watch the parts of your choice in the video - Videos enriched with abstracts, b
From playlist Algebraic and Complex Geometry
Shannon 100 - 27/10/2016 - Jean Louis DESSALLES
Information, simplicité et pertinence Jean-Louis Dessalles (Télécom ParisTech) Claude Shannon fonda la notion d’information sur l’idée de surprise, mesurée comme l’inverse de la probabilité (en bits). Sa définition a permis la révolution des télécommunications numériques. En revanche, l’
From playlist Shannon 100
Nexus Trimester - Alexander Shen (LIRMM, Montpellier) 1/2
Different versions of Kolmogorov complexity and a priori probability: a gentle introduction 1/2 Alexander Shen (LIRMM, Montpellier) February 01, 2016 Abstract: The informal idea – the complexity is the minimal number of bits needed to describe the object – has several different implement
From playlist Nexus Trimester - 2016 - Distributed Computation and Communication Theme
How Karatsuba's algorithm gave us new ways to multiply
To advance the field of computer science, mathematician Kolmogorov tried to optimise the multiplication algorithm we learn in elementary school. After failing to do so, he conjectured that no faster algorithms exist. This gave rise to Karatsuba's fast multiplication algorithm, an algorithm
From playlist Summer of Math Exposition Youtube Videos