Ciro Santilli @cirosantilli  40

If your kids are about to starve, fine, do it.

But otherwise, Ciro Santilli will not, ever, spend his time drilling programmer competition problems to join a company, life is too short for that.

Life is too short for that. Companies must either notice that you can make amazing open source software projects or contributions, and hire you for that, or they must fuck off.

Companies must either notice that you can make amazing projects or contributions, and hire you for that, or they must fuck off.

Others:

Like Jimmy Wales, he used to work in finance and then quit. What is it with those successful e-learning people??

Good ones:

This is a good book. It is rather short, very direct, which is a good thing. At some points it is slightly too direct, but to a large extent it gets it right.

The main goal of the book is to basically to build the Standard Model Lagrangian from only initial symmetry considerations, notably the Poincaré group + internal symmetries.

The book doesn't really show how to extract numbers from that Lagrangian, but perhaps that can be pardoned, do one thing and do it well.

DokuWiki about physics, mostly/fully written by Jakob Schwichtenberg and therefore focusing on particle physics, although registration might be open to all.

Wikipedia mentions quoting his Nobel Prize biography:

A phase of Fe-C characterized by the low ammount of carbon.

Setting: you are sending bits through a communication channel, each bit has a random probability of getting flipped, and so you use some error correction code to achieve some minimal error, at the expense of longer messages.

This theorem sets an upper bound on how efficient you can be in your encoding, for any encoding.

The next big question, which the theorem does not cover is how to construct codes that reach or approach the limit. Important such codes include:

But besides this, there is also the practical consideration of if you can encode/decode fast enough to keep up with the coded bandwidth given your hardware capabilities.

news.mit.edu/2010/gallager-codes-0121 explains how turbo codes were first reached without a very good mathematical proof behind them, but were still revolutionary in experimental performance, e.g. turbo codes were used in 3G/4G.

But this motivated researchers to find other such algorithms that they would be able to prove things about, and so they rediscovered the much earlier low-density parity-check code, which had been published in the 60's but was forgotten, partially because it was computationally expensive.