Icanreply유튜브 인기 댓글 실시간 랭킹
← 뒤로

The Biggest Misconception of Computer Science - Alex Dathskovsky - NDC Toronto 2026

NDC Conferences · 919 views

YouTube에서 보기

인기 댓글

1위@ThanhNguyen-sl2kd3 days ago (edited)

One way to think about this is suppose you need to send a lot of data to your friend across the globe, there could be 2 ways to do this: 1. Just streaming the bytes over (the more data you have the longer you have to stream) -> O(n) 2. Take the hard drive and fly to your friend's home and hand then the drive (no matter how much data you have, you must always take the same flight, same flight duration) -> O(1) So you can see that O(n) or O(1) does not decide the speed of an algorithm, but decides the change of speed when the input scales.번역 보기

👍 1 좋아요

댓글 0

· 로그인 없이 익명 동물 이름으로 참여합니다

2위@p-agiguere55943 days ago

Alex the GOAT!번역 보기

👍 0 좋아요

댓글 0

· 로그인 없이 익명 동물 이름으로 참여합니다

3위@JoeMacBro3 days ago

What if we want to break dual use capabilities at the base level?번역 보기

👍 0 좋아요

댓글 0

· 로그인 없이 익명 동물 이름으로 참여합니다

관련 영상

UPSSSC Lower PCS 2026 | Science & Tech | बौद्धिक संपदा अधिकार | Science & Tech One Shot, Ankit SirScience & Tech Practice Set-02 | UPSSSC Lower PCS 2026 | Expected MCQs + PYQs | Final Assault SeriesWorld's First Development by Korea! The 'Ultra-Innovative' 3rd Generation Seawater Desalination T...Live: Lula meets with science and technology system leaders10 Medieval Technologies Modern Science Still Can't RecreateBiotechnology for UPSC | CRISPR, Gene Therapy & Genome India Project Explained | PragyanPowering Agentic AI with AI-Ready Data Platforms That Turn Data Into IntelligenceHow Quran Astonished Modern Science & AI | Scientific Miracles in Quran
Icanreply유튜브 인기 댓글 실시간 랭킹위젯 임베드로그인 없이 익명 동물 이름으로 참여합니다