Видео 43
Просмотров 163 784

9:14

Real Engineer Plays Poly Bridge 2!

7:37

MNIST 99% Speedrun in 14:16 with commentary

8:40

Speedrun - MNIST99% in 14:16 (PB/WR)

15:04

Hitman 3 | The Ignatiev Integrity Level 2 | World Records (1:28 and 1:26)

3:07

Grafisk Brugerflade til opensees

4:04

What Lies Between the Fibonacci Numbers?

In this little python video, we have a look at Fibonacci numbers. First, we try a few function to generate the normal numbers:
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
Then we look at what happens between these numbers. If Fx is the xth Fibonacci number, then F7 = 8 and F8 = 13, but then what is F7.5? Join me and find out!
The notebook used in this video is available at:
colab.research.google.com/drive/1K6jWQSXzhCz9sOy5SyEHA-k4samWhWhr?usp=sharing
Feel welcome to grab a free copy!

Видео

9:14

Best of Blinkende Lygter (2000)

Просмотров 155 тыс.3 года назад

One of Mads Mikkelsens finest films from 2000 before his subsequent rise to international fame.

7:37

Real Engineer Plays Poly Bridge 2!

Просмотров 1573 года назад

In todays video, see how I handle bridge building in the cartoonish world of Poly Bridge 2! Follow me on twitch where I often stream Poly Bridge 2, but also other relevant game and SpeedCoding, where I code challenges from scratch as quickly as possible. twitch.tv/asgerjon/

MNIST 99% Speedrun in 14:16 with commentary

8:40

MNIST 99% Speedrun in 14:16 with commentary

Просмотров 1913 года назад

Come visit me on twitch: twitch.tv/asgerjon/

15:04

Speedrun - MNIST99% in 14:16 (PB/WR)

Просмотров 313 года назад

In this speedrun we attempt to build a neural network based on pytorch from a blank colab notebook as quickly as possible. The run begins as soon as typing begins in the top cell of the notebook. It ends once the neural network correctly classifies at least 9900 out of the 10000 in the MNIST test data. Rules: §1 Run must start with blank notebook §2 Copy/Pasting from previous coding is prohibit...

Hitman 3 | The Ignatiev Integrity Level 2 | World Records (1:28 and 1:26)

3:07

Hitman 3 | The Ignatiev Integrity Level 2 | World Records (1:28 and 1:26)

Просмотров 633 года назад

Hitman 3 | The Ignatiev Integrity Level 2 | World Records (1:28 and 1:26)

4:04

Grafisk Brugerflade til opensees

Просмотров 1853 года назад

I denne video demonstreres en simpel grafisk brugerflade til opensees. Se mere om opensees her: opensees.berkeley.edu/

Asus Strix Raid DLX/Pro - Solution to driver problem :)

2:51

Asus Strix Raid DLX/Pro - Solution to driver problem :)

Просмотров 2,2 тыс.3 года назад

Asus Strix Raid DLX/Pro - Solution to driver problem :)

5:52

Kompleks tal fra Polær til Rektangulær

Просмотров 2354 года назад

I denne video omdanner vi et polært komplekst tal til et rektangulært komplekst tal.

6:34

Projekt Euler 008 i C++

Просмотров 595 лет назад

Find det største tal man kan få ved at gange 13 tal sammen, som står ved siden af hinanden i dette 1000 ciffer lange tal: 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135...

9:51

Projekt Euler 006 og 007 i C++

Просмотров 845 лет назад

Kvadratet på summen minus summen af kvadraterne samt primtal nr. 10001. Filerne i videoen kan findes på: github.com/matbot1337/projecteuler Music: www.purple-planet.com

13:57

Projekt Euler 005 i C++

Просмотров 975 лет назад

5000 gange hurtigere! Det største palindrome produkt af to trecifrede tal. Filer fra videoen kan findes på min GitHub: github.com/matbot1337/projecteuler

8:34

Projekt Euler 004 i C++

Просмотров 645 лет назад

Find det største palindrom som kan fås ved at gange to trecifrede tal sammen. Filer fra videoen kan findes på min GitHub: github.com/matbot1337/projecteuler

Projekt Euler 003 i C++, nu med bedre video!

21:17

Projekt Euler 003 i C++, nu med bedre video!

Просмотров 875 лет назад

Find den største primfaktor i tallet 600851475143. Koder vist i videoen kan findes på github: github.com/matbot1337/projecteuler

11:06

Projekt Euler 002 i C++

Просмотров 755 лет назад

Summen af lige Fibonacci tal, som er mindre end 1000 Man må faktisk ikke have tuborg paranteser i sin description her på youtube, så I skal lige gå ind på min github, hvis I gerne vil have filerne: github.com/matbot1337/projecteuler