Turing Machines and The Halting Problem (Part 2)
The Halting Problem has fascinated thousands of computer scientists from around the world. A major part of Computing Logic, the proof of the halting problem proves that computers can't do everything. Check out the video to learn more about why computers work the way they do! For Turing Ma
From playlist Math
What Computers Can't Do - with Kevin Buzzard
Kevin Buzzard explains one of the biggest unsolved problems in theoretical computer science - the P vs NP problem. Watch the Q&A here: https://youtu.be/A6J9p4iOr3A Subscribe for regular science videos: http://bit.ly/RiSubscRibe Today’s computers are lightning-fast. But sometimes we want
From playlist Computing/Tech/Engineering
AlterConf Berlin 2017: The Hardest Problems in Computer Science by Anjana Vakil
AlterConf Berlin 2017: The Hardest Problems in Computer Science by Anjana Vakil They say there are two hard problems in computer science: cache invalidation, naming, and off-by-one errors. In this talk, we'll consider these problems in the context of diversity and inclusion in the CS/tech
From playlist AlterConf Berlin 2017
P vs. NP - The Biggest Unsolved Problem in Computer Science
Get a free audiobook and a 30-day trial of Audible (and support this channel) at http://www.audible.com/upandatom or text "upandatom" to 500 500 on your phone. Hi! I'm Jade. If you'd like to consider supporting Up and Atom, head over to my Patreon page :) https://www.patreon.com/upandat
From playlist Computer Science
The "P vs. NP" Problem: Efficient Computation....Knowledge" - Avi Wigderson
Avi Wigderson Institute for Advanced Study October 24, 2008 The "P vs. NP" problem is a central outstanding problem of computer science and mathematics. In this talk, Professor Wigderson attempts to describe its technical, scientific, and philosophical content, its status, and the implic
From playlist Mathematics
Introduction to the most famous unsolved problem in Computer Science. Introduction to Turing Machines, runtime of algorithms, and the classes P and NP. What would the universe look like if P=NP. History of the problem, and attempts to solve the problem. Example adapted from https://en.wiki
From playlist CS50 Seminars 2016
Elementary open problems in Algebra (with consequences in computational complexity) - Avi Wigderson
Computer Science/Discrete Mathematics Seminar II Topic: Elementary open problems in Algebra (with consequences in computational complexity) Speaker: Avi Wigderson Affiliation: Member, School of Mathematics Date: October 2, 2017 For more videos, please visit http://video.ias.edu
From playlist Mathematics
Uncomputable problems: Theory of Computation (Apr 30, 2021)
This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Download class notes from class website. Class website: http://cstaecker.fairfield.edu/~cstaecker/courses/2021s3342/
From playlist Math 3342 (Theory of Computation) Spring 2021
Turing Machines & The Halting Problem (Part 1)
In the year 1900, David Hilbert gave a list of 23 mathematics problems for the mathematicians of the new generation. His tenth problem proved to be an enigma for many years until Alan Turing solved it while simultaneously creating the modern computer. Watch the video to see how Alan Turi
From playlist Math
The P versus NP problem - Efficient computation and the limits of human knowledge - AVI Wigderson
Speaker : Avi Wigderson ( IAS, Princeton ) Date and Time : 27 Dec 2009, 05:30 PM Venue : J. N. Tata Auditorium, IISc, Bangalore The P vs. NP problem is a central outstanding problem of computer science and mathematics. In this talk I will attempt to describe its technical, scientific and
From playlist Public Lectures
Results and open problems in theory of quantum complexity - Anindya De
Andris Ambainis University of Latvia; Member, School of Mathematics April 22, 2014 I will survey recent results and open problems in several areas of quantum complexity theory, with emphasis on open problems which can be phrased in terms of classical complexity theory or mathematics but ha
From playlist Mathematics
The Four Color Map Theorem - Numberphile
The Four Color Map Theorem (or colour!?) was a long-standing problem until it was cracked in 1976 using a "new" method... computers! A little bit of extra footage from this: https://youtu.be/laMkuPrad3s This video features Dr James Grime - http://jamesgrime.com More Grime videos: http://
From playlist Graph Theory on Numberphile
When to Chillax (According to Computer Science)
Sign up to brilliant.org to receive a 20% discount with this link! https://brilliant.org/upandatom The Computer Science Algorithm Technique of Relaxation. Algorithms to Live By - Brian Christian and Tom Griffiths https://www.amazon.com/Algorithms-Live-Computer-Science-Decisions/dp/1627
From playlist Computer Science
IMS Public Lecture - Can Every Mathematical Problem Be Solved?
Menachem Magidor, The Hebrew University of Jerusalem, Israel
From playlist Public Lectures
Computation Ep33, The Halting Problem (Apr 27, 2022)
This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi
From playlist Math 3342 (Theory of Computation) Spring 2022
The Ramanujan Conjecture and some diophantine equations - Peter Sarnak
Speaker : Peter Sarnak Date and Time : Faculty Hall, IISc, Bangalore Venue : 25 May 12, 16:00 One of Ramanujan's most influential conjectures concerns the magnitude of the Fourier Coefficients of a modular form. These were made on the basis of his calculations as well as a far-reaching in
From playlist Public Lectures
What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)
There are a lot of unsolved problems in complexity theory, but there are a few things we do know. We look at the Time Hierarchy Theorem, and also why the proof techniques don't transfer to P vs NP. Created by: Cory Chang Produced by: Vivian Liu Script Editor: Justin Chen, Zachary Greenber
From playlist P vs NP
Unpredictability, Undecidability, and Uncomputability
Quite a number of mathematical theorems prove that the power of mathematics has its limits. But how relevant are these theorems for science? In this video I want to briefly summarize an essay that I just submitted to the essay contest of the Foundational Questions Institute. This year the
From playlist Philosophy of Science
Computation Ep1, Historical intro (Jan 18, 2022)
This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi
From playlist Math 3342 (Theory of Computation) Spring 2022