You asked for something that was more like a stream of consciousness. I'm going to give this a try. My plan is to release tech videos on Saturdays for the kids that I'm teaching, and to release reaction videos on Tuesdays. The reaction videos don't require any planning at all. So I think that schedule might be sustainable.
this is probably why game sizes are getting absolutely ridiculous for no reason. 100 gigs plus is pretty normal nowadays, no deep knowledge, no Kolmogorov complexity knowledge. New game studios such as 343 are a prime example of this atrocity.
4:17 Big O denotes how an algorithm scales, not its actual performance, predicting which requires taking many other things into account. A classic example is linked lists, which are often slower than vector (dynamic arrays) even for operations, such as inserting in the middle, where it is theoretically better than a vector. Big O isn't that deep of knowledge compared to know what the computer actually has to do.
![[LIVE] : ONE ลุมพินี 76 | คู่เอก "ผึ้งหลวง vs สมิงดำ"](http://i.ytimg.com/vi/9SBshmGQOIM/mqdefault.jpg)
Perhaps this is the start of a new series 👀 “Matt Reacts”.
You asked for something that was more like a stream of consciousness. I'm going to give this a try. My plan is to release tech videos on Saturdays for the kids that I'm teaching, and to release reaction videos on Tuesdays. The reaction videos don't require any planning at all. So I think that schedule might be sustainable.
@@MattLaine Sounds great! I look forward to it, and I’m sure others do as well.
Deep knowledge is used in programming for things like whether an electric car blows smoke backwards when moving 100mph. Can you help me ?
this is probably why game sizes are getting absolutely ridiculous for no reason. 100 gigs plus is pretty normal nowadays, no deep knowledge, no Kolmogorov complexity knowledge. New game studios such as 343 are a prime example of this atrocity.
no good reason anyway
I know you are a software engineer but what exactly is your job?
4:17 Big O denotes how an algorithm scales, not its actual performance, predicting which requires taking many other things into account.
A classic example is linked lists, which are often slower than vector (dynamic arrays) even for operations, such as inserting in the middle, where it is theoretically better than a vector. Big O isn't that deep of knowledge compared to know what the computer actually has to do.
LOL, ironic ain't it ?