Algorithms Explained: Computational Complexity
An overview of computational complexity including the basics of big O notation and common time complexities with examples of each. Understanding computational complexity is vital to understanding algorithms and why certain constructions or implementations are better than others. Even if y
From playlist Algorithms Explained
Difficulties with real numbers as infinite decimals (II) | Real numbers + limits Math Foundations 92
This lecture introduces some painful realities which cast a long shadow over the foundations of modern analysis. We study the problem of trying to define real numbers via infinite decimals from an algorithmic/constructive/computational point of view. There are many advantages of trying
From playlist Math Foundations
Depth complexity and communication games - Or Meir
Or Meir Institute for Advanced Study; Member, School of Mathematics September 30, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
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
Complexity and hyperoperations | Data Structures Math Foundations 174
We introduce the idea of the complexity of a natural number: a measure of how hard it is to actually write down an arithmetical expression that evaluates to that number. This notion does depend on a prior choice of arithmetical symbols that we decide upon, but the general features are surp
From playlist Math Foundations
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
Determine a Time Complexity of Code Using Big-O Notation: O(1), O(n), O(n^2)
This video explains how to determine the time complexity of given code. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
Difficulties with real numbers as infinite decimals ( I) | Real numbers + limits Math Foundations 91
There are three quite different approaches to the idea of a real number as an infinite decimal. In this lecture we look carefully at the first and most popular idea: that an infinite decimal can be defined in terms of an infinite sequence of digits appearing to the right of a decimal point
From playlist Math Foundations
Computational complexity of solving polynomial differential equations over unbounded domains
From playlist Symbolic-Numeric Computing Seminar
Title: Computing real solutions to systems of polynomial equations using numerical algebraic geometry Symbolic-Numeric Computing Seminar
From playlist Symbolic-Numeric Computing Seminar
Lenore Blum - Alan Turing and the other theory of computing and can a machine be conscious?
Abstract Most logicians and theoretical computer scientists are familiar with Alan Turing’s 1936 seminal paper setting the stage for the foundational (discrete) theory of computation. Most however remain unaware of Turing’s 1948 seminal paper which introduces the notion of condition, sett
From playlist Turing Lectures
Sarah Percival 7/27/22: Computation of Reeb Graphs in a Semi-Algebraic Setting
The Reeb graph is a tool from Morse theory that has recently found use in applied topology due to its ability to track changes in connectivity of level sets of a function. In this talk, I will motivate the use of semi-algebraic geometry as a setting for problems in applied topology and sho
From playlist AATRN 2022
The chaotic complexity of natural numbers | Data structures in Mathematics Math Foundations 175
This is a sobering and perhaps disorienting introduction to the fact that arithmetic with bigger numbers starts to look quite different from the familiar arithmetic that we do with the small numbers we are used to. The notion of complexity is key in our treatment of this. We talk about bot
From playlist Math Foundations
This video lesson is part of a complete course on neuroscience time series analyses. The full course includes - over 47 hours of video instruction - lots and lots of MATLAB exercises and problem sets - access to a dedicated Q&A forum. You can find out more here: https://www.udemy.
From playlist NEW ANTS #2) Static spectral analysis
Complex sine waves and interpreting Fourier coefficients
Now that you know the basic mechanics underlying the Fourier transform, it's time to learn about complex numbers, complex sine waves, and how to extract power and phase information from a complex dot product. Don't worry, it's actually not so complex! The video uses files you can download
From playlist OLD ANTS #2) The discrete-time Fourier transform
Eigenvalues of product random matrices by Nanda Kishore Reddy
PROGRAM :UNIVERSALITY IN RANDOM STRUCTURES: INTERFACES, MATRICES, SANDPILES ORGANIZERS :Arvind Ayyer, Riddhipratim Basu and Manjunath Krishnapur DATE & TIME :14 January 2019 to 08 February 2019 VENUE :Madhava Lecture Hall, ICTS, Bangalore The primary focus of this program will be on the
From playlist Universality in random structures: Interfaces, Matrices, Sandpiles - 2019
Antonio Lerario: Random algebraic geometry - Lecture 2
CONFERENCE Recording during the thematic meeting : "Real Algebraic Geometry" the October 25, 2022 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audio
From playlist Algebraic and Complex Geometry
Towards derived Satake equivalence for symmetric varieties - Tsao-Hsien Chen
Workshop on Representation Theory and Geometry Topic: Towards derived Satake equivalence for symmetric varieties Speaker: Tsao-Hsien Chen Affiliation: University of Minnesota; Member, School of Mathematics Date: April 03, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Complex Analysis L08: Integrals in the Complex Plane
This video explores contour integration of functions in the complex plane. @eigensteve on Twitter eigensteve.com databookuw.com
From playlist Engineering Math: Crash Course in Complex Analysis
Fractions and repeating decimals | Real numbers and limits Math Foundations 89 | N J Wildberger
We introduce some basic orientation towards the difficulties with real numbers. In particular the differences between computable and uncomputable irrational numbers is significant. Then we discuss the relation between fractions and repeating decimals, giving the algorithms for converting
From playlist Math Foundations