The Origin of Computer Science (Leibniz, Boole, Babbage, Turing)
Вставка
- Опубліковано 18 січ 2016
- Introduction to our series on the origins and history of Computer Science. The story of a collision between math and philosophy featuring Leibniz, Boole, Babbage, Turing, Shannon, Russel, Gödel and many more...
Support this independent effort on Patreon: / artoftheprobl. .
computer science introduction / intro to computer science
(BTW, 140 trillion trillion trillion plus 1 is divisible by 3, and therefore not prime.)
THAT WAS BEAUTIFUL!!! its great to see channels like this amongst all the Garbage that is floating on youtube. Thank you for taking the time to make this.
More Art of the Problem videos? That cheered my day right up!
I've used your videos quite in some of the classes I teach and they've really piqued and interest in some of the students and just want you to know I really appreciate the quality and effort you put into these videos. I look forward to getting more young students hooked on them in the future!
this is great, would love to know how this series goes with students
New Art of the Problem series?!
Yes! I've been sharing your videos for years, stoked to see you're still working :)
Thanks so much for continuing this channel.
You have a unique talent to explain difficult concepts easily and all the while entertaining.
One of my all time fav channels, so glad you're back.
please share this patreon campaing on social media. All videos from art of the problem are amazing.
I am so glad this channel is making new material again! The Language of Coins series was one of my favourite series of educational videos I've ever seen on any subject.
What are the odds. I was just re-watching the videos on Information Theory and this video was uploaded. Thank you for everyone who puts effort in these amazing videos.
I'm so excited for the rest of this series. Your content is amazing.
Glad to see a new video up. Thank you.
Wonderfully interesting! I'm very excited to watch the rest of this series!
When the video asked if 140 trillion trillion trillion plus 1 is prime... I knew the answer almost immediately. The answer is: this number is divisible by 3 and so is *not* prime. If the "digital sum" (the sum of all the digits in a number; if this sum is multiple digits, sum the remaining digits again)... if the "digital sum" of a number is divisible by 3, then the number itself is divisible by three. The digital sum of 140 trillion trillion trillion plus one... is 1 plus 4 plus 1, or 6. Three divides evenly into six, so 140 trillion trillion trillion plus one evenly divides by 3.
Incredible, incredible channel. Very good work. Thank you.
Very informative! Thanks so much!
I'm interested. Looking forward to the next video.
HYPE =D Awesome a new series!
Fun fact: It was very recently discovered that "checking whether a number is prime" is actually an "easy" problem, unlike what the video suggests.
A better example is this: "In a social network, what is the largest number of people who are all friends with each other?" (aka the Maximum Clique Problem). This problem is so hard that if you can prove that it's problem in the "easy" category, then a huge set of other hard problems must be easy as well, i.e. you've proven P=NP.
p.s. How does a clock tick at the speed of light? Clocks tick with a frequency (# of ticks per second), not a velocity (meters per second) ;)
Great as always, keep on rocking
Love it! Keep them coming. :)
Love this channel!!
Knowledge mechanization. Best intro to CS, period.
thrilled you found this series, would love feedback on it
@@ArtOfTheProblem This is the best intro. I really have no feedback. No CS prof. ever told me that computer is the humans' desire to automate their minds.
@@ArtOfTheProblem You obviously put ton of effort in these videos. However, if you want to speed up the production, I think you don't need to do some footage, your videos will still be very good.
@@ThanadejR appreciate it
This is an interesting way to introduce the topic of Computer Science. I like the way you explain how modern computers are connected to the industrial age.
"Practical" vs "Not Practical"; clever :)
"Polynomial" and "Non Polynomial" actually
+Emmet O'Toole Nope, it's polynomial time vs nondeterministic polynomial time. They're both polynomial, but P is *solved* in polynomial time and NP can only be *verified* in polynomial time.
+Emmet O'Toole The classical blunder :)
+bjb2 Yes, and I know people who already know CS theory will be concerned about confusing NP with "Not Practical". The visual NP in this video is more like an easter egg, there is nothing in this script about NP, proper. These are made for the new learner so we start with the intuitive idea of practical vs. not practical, and gradually refine this into some real definition way later (starting with P, then EXP and then NP). Eventually we'll define an interesting set of easy to verify problems we run into all the time which "may or may not be partitioned". It was really a happy accident that NP is an acronym for "not practical"
+Art of the Problem "Nondeterministic Polynomial time" is really confusing and a turn-off, I think the way you introduced it is great (although maybe you should've mentioned that's not actually what it means!)
The best explanation I've heard of NP is "it's polynomial time if you have perfect luck". Tetris is NP. Can you survive tetris given these specific 100 pieces? Ask the perfectly lucky guy. He'll survive if it's possible to survive, finding the answer in polynomial time!
So, if you can engineer luck, P = NP (hint: you probably can't)
p.s. (maybe quantum computer can?)
I love this channel!
Best videos, Thanks!
never knew any thing like that...great video...
Are the others episodes (2 to 10) being produced yet? Because I can't find them...
Amazingly done. So many complex things compromised into such a short overview, yet conveying enough information for those who have never heard of it before. This video alone might finally be a good candidate to show those people, who think CS is only about programming or CS = IT.
Furthermore, I am not too sure about the images you use. For example you showed the endless tape which was supposed to be a (universal) Turing machine but you did not mention this explicitly, you only showed it. This way those who know what it is, will get it but others probably won't. But it should not be confusing either, so don't know.
Same for the prime "circle". You show the numbers and the pattern but you only mention prime numbers, not what this shown pattern is actually about.
love your videos. keep it up (Y)
Sir, i am yr fan. Can u make a series for OS also like not theory but why it exist and how it operated ? it's history.
amazing
Great video😍😍😍
glad you found it, please help spread the word!
CAN KNOWLEDGE BE MECHANIZED?
GOOSEBUMPS FR
right?? stay tuned for my next video took 3 years and connect to this
@@ArtOfTheProblem cant wait! been watching and rewatching your videos for years now, super high quality 👌
awesome I hope I can bring this channel back to life with more content@@pawarranger
@@ArtOfTheProblem im sure you will, good luck!
who makes the music for your videos?
+XxtrickytrickyxX Cameron Murray (his website: cameronmichaelmurray.bandcamp.com/album/art-of-the-problem-volume-1-gambling-with-secrets)
Wow - thanks for the quick reply. The music goes perfectly with the videos! :D
YEAAAAHHHH
guess whos back back back back again gain gain
My god he is back o.o
shadys back
Ok, just sent 0.025 btc (p.s. I was originally looking for a btc option on your Patreon page, to no avail... maybe at least include address somewhere?). If at least 2 other people send 0.025+ btc as well, I'll send another 0.025 btc!
+Paul Capestany for anyone doing ⌘+F trying to find bitcoin donation address to support this awesome channel, it's: 1J29nKVys3anVaQNnyW8DBkD4vCzFxdB2r
+Paul Capestany you rock!
+Art of the Problem don't get tempted to just send yourself 0.05 btc, cuz bitcoin tx network graph analysis ain't hard-J/K-ing...mostly ;)
They way you put it on the video looks like testing a number for primality is a hard problem(NP), but it is not.
+Dzyan Escudero No. It is built on the fact that is hard to find the prime factors of a number. This channel has a whole series about RSA. Check it out : )
+Dzyan Escudero No. There are far better ways to test for a number's primality than just brute forcing, however. Primality test is a "Pratical" problem, as stated in the video. Pretty much any problem will get slower to solve when you get to the trillions of trillions of trillions. Finding new primes is another problem, but there are very clever ways to generate them.
Nevertheless, primality testing is not NP, as I stated on my original comment.
Hey! Just sent you an email under the subject line ‘Optica Entertainment & Creative Nation Inquiry’ if that helps you find it. Hoping to hear back from you! :)
When are you going to release the episode on quantum computing?
"A classical computer has a memory made up of bits, where each bit is represented by either a one or a zero. A quantum computer maintains a sequence of qubits. A single qubit can represent a one, a zero, or any quantum superposition of those two qubit states..."
140 million trillion billion trillion....+1 is divisible by 3 :p
Why the fuck is there eerie, creepy music in the background of this video...
amor fati
140 trillion trillion trillion plus 1 isn't prime. It's divisible by 3
Actually PRIMES is in P, so it ain't that hard. Did you mean factoring ?
Solid content and writing - but PLEASE get different voiceover talent.
i want to like you, but you speak so terribly slowly