Constructivism (mathematics) | Computational complexity theory

Non-constructive algorithm existence proofs

The vast majority of positive results about computational problems are constructive proofs, i.e., a computational problem is proved to be solvable by showing an algorithm that solves it; a computational problem is shown to be in P (complexity) by showing an algorithm that solves it in time that is polynomial in the size of the input; etc. However, there are several non-constructive results, where an algorithm is proved to exist without showing the algorithm itself. Several techniques are used to provide such existence proofs. (Wikipedia).

Video thumbnail

Existence Proofs

Ben discusses constructive and non-constructive proofs with examples.

From playlist Basics: Proofs

Video thumbnail

Discrete Math - 1.8.2 Proofs of Existence And Uniqueness

Using varying methods of proof to prove existence or existence of a unique value. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz

From playlist Discrete Math I (Entire Course)

Video thumbnail

Existence and uniqueness -- Proofs

This lecture is on Introduction to Higher Mathematics (Proofs). For more see http://calculus123.com.

From playlist Proofs

Video thumbnail

Hugo Herbelin: A constructive proof of dependent choice, compatible with classical logic

The lecture was held within the framework of the Hausdorff Trimester Program: Constructive Mathematics. Abstract: Martin-Löf's type theory has strong existential elimination (dependent sum type) what allows to prove the full axiom of choice. However the theory is intuitionistic. We give

From playlist Workshop: "Constructive Mathematics"

Video thumbnail

Hope for a Type-Theoretic Understanding of Zero-Knowledge - Noam Zeilberger

Noam Zeilberger IMDEA Software Institute; Member, School of Mathematics October 4, 2012 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Obvious Theorems (Which Are False)

►WEBSITE https://www.brithemathguy.com ►MY COURSE Prove It Like A Mathematician! (Intro To Math Proofs) https://www.udemy.com/course/prove-it-like-a-mathematician/?referralCode=D4A14680C629BCC9D84C ►BECOME A CHANNEL MEMBER https://www.youtube.com/channel/UChVUSXFzV8QCOKNWGfE56YQ/join #

From playlist Shorts

Video thumbnail

Existence & Uniqueness Theorem, Ex1.5

Existence & Uniqueness Theorem for differential equations. Subscribe for more math for fun videos 👉 https://bit.ly/3o2fMNo For more calculus & differential equation tutorials, check out @justcalculus 👉 https://www.youtube.com/justcalculus To learn how to solve different types of d

From playlist Differential Equations: Existence & Uniqueness Theorem (Nagle Sect1.2)

Video thumbnail

Making Proofs More Constructive, and Algorithms Less Random - Oliver Korten

Computer Science/Discrete Mathematics Seminar I Topic: Making Proofs More Constructive, and Algorithms Less Random Speaker: Oliver Korten 11:15am|Simonyi 101 and Remote Access Affiliation: Columbia University September 26, 202 A central topic in the theory of computation is derandomizati

From playlist Mathematics

Video thumbnail

Structure vs Randomness in Complexity Theory - Rahul Santhanam

Computer Science/Discrete Mathematics Seminar I Topic: Structure vs Randomness in Complexity Theory Speaker: Rahul Santhanam Affiliation: University of Oxford Date: April 20, 2020 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Sum of nonnegative powers of 2 = -1 [Bogus Proofs]

In this video we prove that the sum of the nonnegative powers of 2 is equal to -1. Can you find the error? For a typed transcript of this proof check out our blog: https://centerofmathematics.blogspot.com/2018/12/bogus-proofs.html

From playlist Bogus Proofs

Video thumbnail

Total Functions in the Polynomial Hierarchy - Robert Kleinberg

Computer Science/Discrete Mathematics Seminar I Topic: Total Functions in the Polynomial Hierarchy Speaker: Robert Kleinberg Affiliation: Cornell University Date: February 08, 2021 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Derandomization and its connections throughout complexity theory - Liije Chen

Computer Science/Discrete Mathematics Seminar II Topic: Derandomization and its connections throughout complexity theory Speaker: Liije Chen Affiliation: Massachusetts Institute of Technology Date: February 22, 2022 This is the second talk in a three-part series presented together with R

From playlist Mathematics

Video thumbnail

Non-negatively Weighted #CSPs: An Effective Complexity Dichotomy - Xi Chen

Xi Chen Columbia University March 28, 2011 We prove a complexity dichotomy theorem for all non-negatively weighted counting Constraint Satisfaction Problems (#CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms and t

From playlist Mathematics

Video thumbnail

The Abel lectures: László Lovász and Avi Wigderson

0:30 Introduction by the Abel Prize Committee Chair, Hans Munthe-Kaas 02:42 László Lovász: Continuous limits of finite structures 49:27 Questions and answers 1:00:31 Avi Wigderson: The Value of Errors in Proofs 1:41:24 Questions and answers 1:50:20 Final remarks by John Grue, Chair of the

From playlist Abel Lectures

Video thumbnail

Derandomization and its connections throughout complexity theory - Roei Tell

Computer Science/Discrete Mathematics Seminar II Topic: Derandomization and its connections throughout complexity theory Speaker: Roei Tell Affiliation: Member, School of Mathematics Date: February 15, 2022 This is the first talk in a three-part series presented together with Lijie Ch

From playlist Mathematics

Video thumbnail

Explicit rigid matrices in P^NP via rectangular PCPs - Prahladh Harsha

Computer Science/Discrete Mathematics - Special Seminar Topic: Explicit rigid matrices in P^NP via rectangular PCPs Speaker: Prahladh Harsha Affiliation: Tata Institute of Fundamental Research Date: February 06, 2020 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Avi Wigderson & László Lovász - The Abel Prize interview 2021

00:30 Interview start 01:03 On the place of discrete math and theoretical computer science 08:14 Turing and Hilbert 14:28 P vs NP problem, what is it and why is it important? 25:09 Youth in Haifa, Avi Wigderson 30:09 Youth in Budapest, László Lovász 37:45 Problem solver or theory builde

From playlist László Lovász

Video thumbnail

Number theory Full Course [A to Z]

Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure #mathematics devoted primarily to the study of the integers and integer-valued functions. Number theorists study prime numbers as well as the properties of objects made out of integers (for example, ratio

From playlist Number Theory

Video thumbnail

Introduction to Proof by Contradiction: sqrt(2) is irrational

This video introduces the mathematical proof method of proof by contradiction and provides an example of a proof. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Related pages

Quantum complexity theory | Graph theory | Prime number | Richard K. Guy | Winning Ways for Your Mathematical Plays | Existence theorem | Constructive proof | P (complexity) | Robertson–Seymour theorem | Algorithm | Computational problem | Smooth number