Complexity of Quantum Computation | Scott Aaronson and Lex Fridman
HTML-код
- Опубликовано: 21 окт 2024
- Lex Fridman Podcast full episode: • Scott Aaronson: Comput...
Please support this podcast by checking out our sponsors:
SimpliSafe: simplisafe.com... and use code LEX to get a free security camera
Eight Sleep: www.eightsleep... and use code LEX to get $200 off
ExpressVPN: expressvpn.com... and use code LexPod to get 3 months free
BetterHelp: betterhelp.com... to get 10% off
PODCAST INFO:
Podcast website: lexfridman.com...
Apple Podcasts: apple.co/2lwqZIr
Spotify: spoti.fi/2nEwCF8
RSS: lexfridman.com...
Full episodes playlist: • Lex Fridman Podcast
Clips playlist: • Lex Fridman Podcast Clips
CONNECT:
Subscribe to this RUclips channel
Twitter: / lexfridman
LinkedIn: / lexfridman
Facebook: / lexfridmanpage
Instagram: / lexfridman
Medium: / lexfridman
Support on Patreon: / lexfridman
Well. That was wonderful discussion about I don't what, but was inspiring.
Thanks #Lex
Difficulty of understanding women > Complexity of Quantum Computation
Even the women that don't understand women?
Finally, a subject that is WHOOSH on me once he started on the computer programming stuff.
Making my brain hurt.
Didn't know computers had space.
Didn't know computers went on tours, either.
Quantum advice: if the cat is dead, don't feed it.
How do cryptocurrency and cryptozoology overlap?
Lex, Gatorade zero sucks.
Waiting for the day when, P=NP !
P=NP(compliment)?
:P
I love it when I'm made to understand that I have the intellectual capacity of a rock.
they are definitely at a truck stop
An Ode To C / C++ Thread SAFETY
Static constants abound in the lexical analyzer and compiler. Dynamic linking libraries deploy a plethora of data structures like trees and maps. The linker if static won't undergo modifications by system calls in the appended files at runtime. The loader generates the machine codecs always dynamic in binaries or hexadecimals. The compile time could be automatic or register prompting change in the volatile memory. That makes for thread safe in mutex or deadlock address locations. Any programming languages that are reporting segmentation fault or overflow and overrun are unsafe and need be pontificated for the perverse logic. It could make the operating system crash and the semaphore would rather be rectified to reinstate the infinite loop.
"Solving chess is just a O(1) problem." Then how useful are these classifications really.
That's a tremendously myopic view.
So what happens if two quantum computers play Chess?
We don't know yet. We don't know if there is anyf irst mover advantage
I have no idea what he's talking about.
That studio is a bit of a dump...
No manner! No manner!