What Is Computer Science?

preview_player
Показать описание
Computers are slowly taking over the world, but what exactly do the people behind the computers do? Learn more about what computer science is and how it impacts our world today.

Created by: Cory Chang
Produced by: Vivian Liu
Script Editors: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg

---
Рекомендации по теме
Комментарии
Автор

the videos on this channel are so great! it's really a pity that you don't seem to be creating content anymore :(

cxxxk
Автор

Nice work! The animations did a great job of illustrating your points and it was well presented and explained. I really enjoyed it! :)

HarryAtomic
Автор

This is an awesome video! I haven't found anything else that gives such a good intro to the P?=NP problem

claireborges
Автор

actual video and information begins at 0:55

allyonightmare
Автор

i don't know a lot about computer science, but your visuals and the way you formulate the argument are very good

evildoesnotsleep-xb
Автор

love how you put the youtube UI over it at ~3 10

UnbornAssassin
Автор

Integer factorization is not NP complete though, it is not reducible to any other NP problems. Afaik

Atharvak
Автор

I don't really understand a computer cuz I don't have one but I love this video it is very respectful it teach you a lot about a computer so I hope when I have one this video would help me thank you

nainai
Автор

I don't have a computer but it seems very helpful so I hope soon to get one ☺️ 😜🤠 I like how it teaches you about it so fascinating

shamayaphillip
Автор

You're not the same guy as 3Blue1Brown are you?

robertwilsoniii
Автор

no outro? Really liked your definition of computer science

anuvedantham
Автор

Is the Mario NP-Hard paper yours? I'm looking forward to reading that.

insideoutface
Автор

I'd like to take this opportunity to explain the biggest problem with almost all code learning programs. Code learning programs today are mostly just a jumble of functions. Let's say we're controlling Elsa. elsaUp(); makes Elsa move up 10 pixels, elsaDown(); 10 pixels down, etc. Well, this teaches students close to nothing except for the absolute bare-bones aspect of code, and that's how code works, and possibly even the if(); command or two. Instead of having students be taught nothing more than how to use functions, tell them how to _make_ functions. For example, instead of just having elsaUp(); already be made, have them make it with:

var elsaUp = function() {
= function() {

px = x
py = y
(py - y = 10) {



{
++;



}

technodraconic
Автор

A modern computer science degree is basically a degree in discrete math. But when computer science was founded, it was much more closely related to being a science than it might be considered today. However, even if it has become more about proofs, math and logic, there still are investigations that require observing, and testing factual information to determine breakthroughs. As an example, consider quantum computing and it's development.

ProbablePaul
Автор

Most technically it's the study of algorithms, which are a very specific way of solving problems, but it's hard to define exactly what an algorithm is without getting a good ways into computer science.

ganondorfchampin
Автор

What is the difference between "Computer Science" in English and "L'informatique" in French?

AnungAriwibowo
Автор

Not understanding but I appreciate you tried maybe you can be more understandable? 😶

craftsfun
Автор

I never thought that computer science went far back

nicholasgonzalez
Автор

Thank sir you have discusses is comuter science

animeshmondal
Автор

As a sidenote, we don't know if prime factorization is NP-complete… and we don't know if it's P either! We only know it's NP. I'd be surprised if someone discovered it to be in P—and also if someone found it to be NP-complete, because this would mean quantum computers would solve NP-complete problems in polynomial time. If someone proofs that prime factorization is not P, and not NP-complete, we'd finally know once and for all that P != NP (via Ladner's theorem).

wladston