Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Constructive proof
Formal sciences
Theoretical computer science
Programming language theory
Type theory
Graph Chatbot
Related lectures (29)
Login to filter by course
Login to filter by course
Reset
Previous
Page 3 of 3
Next
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Coupling of Markov Chains: Ergodic Theorem
Explores the coupling of Markov chains and the proof of the ergodic theorem, emphasizing distribution convergence and chain properties.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.
Generalization Error
Explores generalization error in machine learning, focusing on data distribution and hypothesis impact.
Introduction to Coq: Arithmetic Expressions and Evaluators
Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.
Proof of Convergence Rate Theorem
Covers the proof of the convergence rate theorem, emphasizing the correction of a missing factor sqrt{pi_j} in the proof.
Inductive Propositions: Reasoning and Evaluation Techniques
Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.
Trigonometric Polynomials: Fourier Inversion and Plancherel Formulas
Explores trigonometric polynomials, emphasizing Fourier inversion and Plancherel formulas.
Convergence of Fourier Series
Explores the convergence of Fourier series in L² space with trigonometric polynomials and approximation theorems.