![polylog](/img/default-banner.jpg)
- Видео 11
- Просмотров 4 945 476
polylog
Швейцария
Добавлен 22 авг 2021
We explain fun topics in computer science. If you want to support us, check out our Patreon.
And this year's Turing Award goes to...
Support us on Patreon: www.patreon.com/Polylog
We explain why Avi Wigderson got this year’s Turing award: We show how you can make any randomized algorithm deterministic.
0:00 Intro
2:41 P = BPP
5:38 Statistical tests
7:52 Pi as a PRNG
9:44 Nisan-Wigderson PRNG
13:47 Finishing the proof
14:45 Zero-knowledge proofs
Blog post: coming soon
Code for the animations: github.com/polylog-cs/derandomization/
Richard Hladík: Script editor, animator
Václav Rozhoň: Writer, animator
Václav Volhejn: Narrator, animator, script editor
Thank you to our beta testers: Matěj, Honza, Filip
Animations: manim, a Python library docs.manim.community/en/stable/
Color palette: Solarized ethanschoonover.com/solarized/
Music: Thanno...
We explain why Avi Wigderson got this year’s Turing award: We show how you can make any randomized algorithm deterministic.
0:00 Intro
2:41 P = BPP
5:38 Statistical tests
7:52 Pi as a PRNG
9:44 Nisan-Wigderson PRNG
13:47 Finishing the proof
14:45 Zero-knowledge proofs
Blog post: coming soon
Code for the animations: github.com/polylog-cs/derandomization/
Richard Hladík: Script editor, animator
Václav Rozhoň: Writer, animator
Václav Volhejn: Narrator, animator, script editor
Thank you to our beta testers: Matěj, Honza, Filip
Animations: manim, a Python library docs.manim.community/en/stable/
Color palette: Solarized ethanschoonover.com/solarized/
Music: Thanno...
Просмотров: 112 899
Видео
Why arguing generals matter for the Internet
Просмотров 14 тыс.4 месяца назад
0:00 Intro 0:31 The byzantine generals problem 3:51 First solution 10:13 Importance 12:00 Blockchain-based solution 15:57 Wrap-up Support us on Patreon: www.patreon.com/Polylog We solve the Byzantine Generals problem, a fundamental problem of distributed computing. Then, in classic Polylog fashion, we spend the latter half of the video discussing why it matters in the broader context, specifica...
The flaw in every voting system
Просмотров 416 тыс.10 месяцев назад
#some3 0:00 Intro 3:11 Definitions 6:44 Proof 11:39 Arrow's theorem 13:25 Approval voting 17:03 Outro Blog post: vasekrozhon.wordpress.com/2023/09/10/voting-systems/ Github: github.com/polylog-cs/voting-systems Patreon: www.patreon.com/Polylog Credits: Thumbnail by Alžběta Volhejnová To make this video, we used manim, a Python library: docs.manim.community/en/stable/ The color palette we use is...
The most powerful (and useless) algorithm
Просмотров 129 тыс.Год назад
0:00 Intro 2:44 The Algorithm 6:38 Why it works 9:28 Code 10:41 Final Thoughts Our implementation of Universal Search: github.com/polylog-cs/universal-search/blob/main/code/universal_search.py Our Patreon: www.patreon.com/Polylog Impromptu: impromptu.fun/ More about universal search: To prove that the universal search is asymptotically optimal, we implicitly used the fact that there exists a li...
The OPTIMAL algorithm for factoring!
Просмотров 42 тыс.Год назад
Our program: github.com/polylog-cs/universal-search/blob/main/code/universal_search.py RSA factoring challenge: en.wikipedia.org/wiki/RSA_Factoring_Challenge Big thanks to: Tomáš Gavenčiak, Matěj Konečný, Jan Petr, Hanka Rozhoňová, Tom Sláma Our Patreon: www.patreon.com/Polylog Credits: To make this video, we used manim, a Python library: docs.manim.community/en/stable/ The color palette we use...
The hidden beauty of the A* algorithm
Просмотров 838 тыс.Год назад
00:00 Intro 01:38 Change the lengths! 06:34 What is a good potential? 12:31 Implementation 16:20 Bonus Tom Sláma's video: ruclips.net/video/umszOeerdsU/видео.html Our Patreon: www.patreon.com/Polylog Some related stuff: One thing I did not mention is that Dijkstra's algorithm is designed to solve the problem of finding the shortest path from the start node to all other nodes of the graph. It do...
AI cracked this Codeforces problem. Can you?
Просмотров 54 тыс.Год назад
Our Patreon: www.patreon.com/Polylog AlphaCode is a model by DeepMind. alphacode.deepmind.com/ The problem we discussed is from CodeForces. codeforces.com/problemset/problem/1566/E 0:00 Intro 3:29 Problem Statement 5:55 Problem Solution 11:20 Final Thoughts Music New World Symphony by Dvorak. musopen.org/music/4942-symphony-no-9-in-e-minor-from-the-new-world-op-95/#recordings Images The picture...
We designed special dice using math, but there’s a catch
Просмотров 527 тыс.Год назад
How would you order the players randomly? Tell us in the comments. :) Our Patreon: www.patreon.com/Polylog Some proposals that already appeared in the comments section: - Put cards with player names in a sack, shuffle, then take them out one by one to get the order. - Simulate the above process using dice (see the comments by Jordan Weitz and samuraiwarm for how to do it). - Just reroll the dic...
The Simplest Sorting Algorithm (You’ve Never Heard Of)
Просмотров 127 тыс.2 года назад
Our Patreon: www.patreon.com/Polylog We know this beautiful algorithm from the recent preprint by Stanley P. Y. Fung: arxiv.org/pdf/2110.01111.pdf However, it turns out that other people stumbled across it multiple times, see e.g. the discussion here: news.ycombinator.com/item?id=28758106 Attributions: To make this video, we used manim, a Python library: docs.manim.community/en/stable/ The colo...
The trick that solves Rubik’s Cubes and breaks ciphers
Просмотров 2,7 млн2 года назад
What do the Rubik's cube and a cipher from the 70s have in common? Let's find out. Our Patreon: www.patreon.com/Polylog 0:00 Rubik's cube 9:40 DES Links: Feliks setting the 4.73 record ruclips.net/video/R07JiT0PlcE/видео.html&ab_channel=FeliksZemdegs webpage "God's number is 20" www.cube20.org/ The fact it was verified computationally that every cube can be solved in at most 20 moves is super i...
How to Use Beads and Strings to Find the Diameter of a Tree
Просмотров 30 тыс.2 года назад
This video was made for the Summer of Math Exposition 1. Check out other cool videos there! www.3blue1brown.com/blog/some1 #some1 Our Patreon: www.patreon.com/Polylog To make this video, we used manim: docs.manim.community/en/stable/ Our video is based on the following great book: Explaining Algorithms Using Metaphors by Michal Forišek and Monika Steinová you can buy it here: www.springerprofes...
Awesome video..really understood the topic!!!
I love how the height (h) in this conceptual map is actually not spatial height Z, but the travel time height! Using the fourth dimention provided by time instead of the third dimention provided by height. It is a really special way of thinking about problem solving.
So how do you prove that you’ve solved a sudoku without showing the solution? You got me hooked and I need a video about it now
How to create a random number: First you take a random number as a seed...
I took a course on cryptography last year taught by a professor who was advised by Silvio Micali. One of the most brilliant people I’ve ever met. This stuff is so cool!
It would be even better to, instead of picking a random number to plug into the polynomials, you plug in pi. No polynomial system will have a solution of pi
Just discovered yoour channel. It's a 💎! Thank you very much for your content! Like and Subscribe!!!
You skipped over the part that is interesting to computer scientists... who is the intended audience?
Great video! Technically, the pi-PRNG wouldn't have to be *that* ineffective if it used e.g. the BBP formula rather than generating all k first digits.
I feel like "reasonable" is being misused here. It is not necessarily reasonable that if a choice makes up the majority of the population's first choices, that it should be put in place. Why? Well imagine a situation where option A was favoured by 51% of the population with value 100/100 (it's the best option they could get) with the remaing 49% of the population rating it 0/100 (the worst impacts possible), while option B was rating as 99/100 by 51% of the population and 100/100 by the minority 49%. Is it reasonable that the minority 49% should be made to suffer a terrible result when the 51% majority is barely affected by the difference in options? Option A would create discord and strife, whereas option B is obviously the option that creates harmony and the maximum good, which is what a democracy should be trying to achieve. Approval voting is not "reasonable" by the above definition and in fact approaches a nache equilibrium where everyone votes against their honest least favoured option, assuming there is no collusion between voters. Yes yes, I know it is just being used as a definition, but it's poor word choice. You could define "reasonable" to be "a system in which the first voter's first preference is selected" and any following statements from that definition would hold, but that doesn't mean that "reasonable" is a good word choice for that definition.
This is how I solve mazes. I start from both ends, then meet in between. But I look ahead. Maybe that's what the meet in the middle algorithm is missing. Can it not trim redundant paths from either end, once a pattern reveals itself from both of the paths? Of course trim the longer path when this occurs.
Thanks for your explanation! Love from China❤
Doesn’t this also prove the converse that truely random numbers don’t exist or can’t be accurately proven to exist with sufficient certainty?
pannenkoek2012 reference detected
I'm surprised I've never heard of this technique.
I loved the Bismuth Mario ABC reference!
Dope bowl cut bro.
You can be the 3 blue 1 brown of CS. Please continue making videos.
11:16 Why is it not 100% certain? If the results ofnthe two expressions are not equal then definitely theynarent equal, right?
Parallel Universes Mentioned
fantastic video, and of course someone made a manim rubiks cube library lol
Btw twin primes conjecture is provable if you relax some mental constraints/parameters or just have chatgpt prove it to you. Since chatgpt is that stupid
Also widen your shot. The elbows being cut off really annoy me. Crash course channel layouts can teach you a thing or two
Stupidity and ignorance
It's worth noting that many of the historic pseudo random generators had a repetition cycle that wasn't large enough to fully explore the possible options in many games of chance such as card games. If worst case, there was never a chance that four aces were not even dealable, so you'd have a lousy game, and it would be easier to fiddle the game. There's a lot of interest in the on-line gambling field about ensuring that overall the house wins, yet it's still 'random' enough. 52 cards, go through all the shuffle orders, once per second, every billion years take a 1cm step along the equator, when you reach the pacific ocean remove a 5mL spoon of water, every time the pacific empties, and a A4 sheet o paper to a pile, when it reaches the moon start actual counting, when you get to a million, realise you are still less than 90% of the way to completing the task. [you need 4 x 64bit words to represent the 52 card deck shuffle number]. And that's not even a 'large' number, never mind an 'arbitrarily large' one.
Where’s the other video
It's a April fools video
2:14 Zwo Franken spotted !! hahah 🇨🇭 Gruezi von Genf :) 🇨🇭 Danke fürs Video, esch wirklich toll !
It just confuses me more. I won't question why people pursue the perfect "randomness" because I'm not a scholar, but things happen and while 111111 happens once in 1/2^6 occasions, when it happens it happens. True random number machine might just drop 11111111111111 and casually go on. Like how monkeys playing with typewriters might write a whole hamlet. I'm happy with my hardware noises processed through linear equstions.
and cache
amazing
Can I use the paused image at 8:05 in a presentation ?
Of course!
Thanks !
Can you explain to me how it is possible I have not yet learned about this wonderful channel? Dobrá práce kluci❤🇨🇿
Dík :)
I was not prepared for the bowl cut... bro you could be handsome just buzz your hair and let it grow out jesus. great video otherwise.
Alright guys, here's the secret behind Google Maps' algorithm: it's **not** A*. It's Contraction Hierarchies. Nice animations, though 👍
just lol that you can get award for thing that programmers use for 20 years
More details here: vasekrozhon.wordpress.com/2024/05/18/avi-wigderson-has-won-the-turing-award/
🤯
Bro really got the 13th century monk cut
Thanks for the video <3 These topics are so interesting
So...PRNGs can be used for random algorithms. This is a huge , groundbreaking, "no shit".
God dammit is everything relative to the observer!?
Does that mean if the 3-SAT problem can be reduced to a BPP polynomial equivalence problem then P = NP?
As far as I know, this is not known. But if somebody proved that, I think most complexity theorists would start believing that P=NP at the very least!
@@PolylogCSDo you know if this theorem applies to multivariable polynomials or is it limited to the case of 1 variable? If multiple variable polynomials are allowed then I may have something along the lines of 3-SAT -> polynomial -> apply BPP = P. So 3-SAT would be in P. I have 0 excitement over this btw. I'm a mathematician and haven't really studied complexity that much so I highly doubt I'll be the one to stumble across such an important proof.
uzasne video!
Thank you I know have a full understanding of randomness. Not sure what to decide about this nowledge though. Guess the pseudo part is part of this paradoxically parallell uni... Never mind. It seems to actually be hard to reapeth the zero knowledge proof in practice.
At least it might have sown some seeds. Looking forward to the growth. Know I decidedly now I put that tree somewhere in this forest.
what IS the assumption MOST researchers believe to be true.
You can look here: vasekrozhon.wordpress.com/2024/05/18/avi-wigderson-has-won-the-turing-award/
Noam Nisan from Nand to Tetris!!!!!!
Very nice!
9:35 - sorry for dragging semantics and philosophy into the discussion, but is there truly such a thing as "random"? You said that Pi only "looks" random, which is perfectly fair, since we have formulas to calculate it. However, if we had a way to perfectly predict any "random" physical process (such as radioactive decay, fluctuations in temperature, etc.) then all of those phenomena would become PRNGs. The state is the state of the universe, the function is physical formulas, and the outcome is perfectly predictable. I think you already touched on that when you mentioned flipping a coin as an example: randomness-as-unpredictability disappears if you can predict the outcome. Besides, once you get a "random" value, doesn't it stop being "random" because you just generated it? Like you said, if you take some digits from pi, they look random, but they're not actually random, because you obtained them through a computation. In more general terms, does that mean that "computable" and "random" are mutually exclusive, and that it's impossible to have a truly random value, because any value we can think of will be "computed" somehow?
One implication of Wigderson's (and Kolmogorov's) work is that I find it philosophically very appealing to think about randomness as being ultimately about unpredictability. Even in the fully deterministic worlds where no "truly random bits" exist, whatever "truly random" means, you can still have construct pseudorandom bits that are for all practical purposes unpredictable and thus random.
My pb was 2.37 i swear
Is formula for circle (c1) x formula for cylinder (c2)= donuts (d) as in topology?? Admin plz do answer.