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
Formal Definition of a Function using the Cartesian Product
Learning Objectives: In this video we give a formal definition of a function, one of the most foundation concepts in mathematics. We build this definition out of set theory. **************************************************** YOUR TURN! Learning math requires more than just watching vid
From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)
Big O Notation: A Few Examples
This video is about Big O Notation: A Few Examples Time complexity is commonly estimated by counting the number of elementary operations (elementary operation = an operation that takes a fixed amount of time to preform) performed in the algorithm. Time complexity is classified by the nat
From playlist Computer Science and Software Engineering Theory with Briana
What are complex numbers? | Essence of complex analysis #2
A complete guide to the basics of complex numbers. Feel free to pause and catch a breath if you feel like it - it's meant to be a crash course! Complex numbers are useful in basically all sorts of applications, because even in the real world, making things complex sometimes, oxymoronicall
From playlist Essence of complex analysis
Said Hamoun (2/23/23): On the rational topological complexity of coformal elliptic spaces
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of the rational homotopy for some special families of
From playlist Topological Complexity Seminar
Introduction to Bivariate Data (1 of 2: Dependent & independent variables)
More resources available at www.misterwootube.com
From playlist Descriptive Statistics & Bivariate Data Analysis
Why Can’t We Classically Describe Quantum Systems? - Chinmay Nirkhe
Computer Science/Discrete Mathematics Seminar I Topic: Why Can’t We Classically Describe Quantum Systems? Speaker: Chinmay Nirkhe Affiliation: MIT-IBM Watson AI Lab Date: March 13, 2023 A central goal of physics is to understand the low-energy solutions of quantum interactions between pa
From playlist Mathematics
Complexity Coarse - Graining in the Black Hole Information Problem - Netta Engelhardt
IAS It from Qubit Workshop Workshop on Spacetime and Quantum Information Tuesday December 6, 2022 Wolfensohn Hall Engelhardt-2022-12-06
From playlist IAS It from Qubit Workshop - Workshop on Spacetime and Quantum December 6-7, 2022
Ximena Fernández 7/20/22: Morse theory for group presentations and the persistent fundamental group
Discrete Morse theory is a combinatorial tool to simplify the structure of a given (regular) CW-complex up to homotopy equivalence, in terms of the critical cells of discrete Morse functions. In this talk, I will present a refinement of this theory that guarantees not only a homotopy equiv
From playlist AATRN 2022
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
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
Knot Categorification From Mirror Symmetry (Lecture- 3) by Mina Aganagic
PROGRAM QUANTUM FIELDS, GEOMETRY AND REPRESENTATION THEORY 2021 (ONLINE) ORGANIZERS: Aswin Balasubramanian (Rutgers University, USA), Indranil Biswas (TIFR, india), Jacques Distler (The University of Texas at Austin, USA), Chris Elliott (University of Massachusetts, USA) and Pranav Pan
From playlist Quantum Fields, Geometry and Representation Theory 2021 (ONLINE)
In this talk, we will define elliptic curves and, more importantly, we will try to motivate why they are central to modern number theory. Elliptic curves are ubiquitous not only in number theory, but also in algebraic geometry, complex analysis, cryptography, physics, and beyond. They were
From playlist An Introduction to the Arithmetic of Elliptic Curves