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
Probabilistic logic programming and its applications - Luc De Raedt, Leuven
Probabilistic programs combine the power of programming languages with that of probabilistic graphical models. There has been a lot of progress in this paradigm over the past twenty years. This talk will introduce probabilistic logic programming languages, which are based on Sato's distrib
From playlist Logic and learning workshop
If you are interested in learning more about this topic, please visit http://www.gcflearnfree.org/ to view the entire tutorial on our website. It includes instructional text, informational graphics, examples, and even interactives for you to practice and apply what you've learned.
From playlist Machine Learning
What does it mean to be Turing Complete? Is HTML & CSS Turing Complete? #shorts #compsci #programming #math
From playlist CS101
Primality (1 of 2: Fermat's Test)
From playlist Cryptography
PMSP - Computational pseudo-randomness and extractors II - Russell Impagliazzo
Russell Impagliazzo Institute for Advanced Study June 14, 2010 For more videos, visit http://video.ias.edu
From playlist Mathematics
Faster Primality Test - 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
23. Probabilistic Computation, BPP
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Defined probabilistic Turing machines
From playlist MIT 18.404J Theory of Computation, Fall 2020
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
Cryptography - Seminar 5 - Polynomial time
This seminar series is about the mathematical foundations of cryptography. In this seminar Eleanor McMurtry explains the definition of probabilistic polynomial time interactive Turing machines. The webpage for this seminar is https://lnor.net/uc-seminar.html. You can join this seminar fr
From playlist Metauni
Zero Knowledge Proofs - Seminar 1 - Introduction
This seminar series is about the mathematical foundations of cryptography. In this series Eleanor McMurtry is explaining Zero Knowledge Proofs (ZKPs), a fascinating set of techniques that allow one participant to prove they know something *without revealing the thing*. You can join this s
From playlist Metauni
22C3: On working memory and mental imagery
Speaker: Victor Eliashberg How does the brain learn to think? A representation of an untrained human brain, call it B(0), is encoded in the human genome -- its size can hardly exceed a few megabytes. In contrast, a representation of a trained brain, B(t), after big enough time t (say t=2
From playlist 22C3: Private Investigations
Professor Mark Girolami: "Probabilistic Numerical Computation: A New Concept?"
The Turing Lectures: The Intersection of Mathematics, Statistics and Computation - Professor Mark Girolami: "Probabilistic Numerical Computation: A New Concept?" Click the below timestamps to navigate the video. 00:00:09 Introduction by Professor Jared Tanner 00:01:38 Profess
From playlist Turing Lectures
Enrichment student panel discussion
Kate Highnam - Enrichment Student at The Alan Turing Institute and postgraduate researcher at the Imperial College London Giuseppe Degan Di Dieco - Enrichment Student at The Alan Turing Institute and PhD student at the University of Bristol Rachel Pirie - Enrichment Student at The Alan T
From playlist Enrichment Scheme Open Event
Proof synthesis and differential linear logic
Linear logic is a refinement of intuitionistic logic which, viewed as a functional programming language in the sense of the Curry-Howard correspondence, has an explicit mechanism for copying and discarding information. It turns out that, due to these mechanisms, linear logic is naturally r
From playlist Talks
Building Machines that Learn & Think Like People - Prof. Josh Tenenbaum ICML2018
Recorded July 13th, 2018 at the 2018 International Conference on Machine Learning Joshua Tenenbaum is Professor of Cognitive Science and Computation at the Massachusetts Institute of Technology. He is known for contributions to mathematical psychology and Bayesian cognitive science. htt
From playlist AI talks
Randomness in Algorithms: Understanding It, Eliminating It
Short Talks by Postdoctoral Members Topic: Randomness in Algorithms: Understanding It, Eliminating It Speaker: Roei Tell Affiliation: Member, School of Mathematics September 30, 2022
From playlist Short Talks by Postdoctoral Members
What is Quantum Machine Learning?
Generative machine learning is the field of ML that focuses on generating data. If you've seen any of the realistic-looking faces on pages such as www.thispersondoesnotexist.com or www.whichfaceisreal.com, you've seen generative machine learning in action. Quantum computing is a rapidly ad
From playlist Fundamentals of Machine Learning
NATS & Turing EPSRC Prosperity Partnership - Tim Dodwell
Introduction The Innovation Symposium was established in 2019 as part of the ongoing collaboration between Accenture and The Alan Turing Institute. Our recently launched strategic partnership has the following goals: - Delivering value from AI and data - Enabling safe and robust applicat
From playlist Innovation Symposium 2021