* "Information Theory" by Cover and Thomas is a mathematical introduction to information theory. This is a technical book, and is very different than the books above.
If you haven't yet done so, read Shannon's paper as linked above
"Just pointed my phone camera directly at the midday sun for 5 minute straight. It got a little warm, but... no damage. I'm gonna go ahead and say point your phones at the eclipse tomorrow, it'll be fine "
just because his phone was fine doesn't mean yours will be
I guess "Degen" in this context means [1] a person "engaged in high-risk, high-reward strategies without much regard for potential losses. These individuals were seen as reckless, often gambling with their investments in the hopes of striking it rich."
I often buy organic food: I can afford it and like the goal of using zero or minimal pesticides and herbicides. For me, it's like Pascal's wager: it can't hurt
Vitalik gave goals of 1.33 MB per second in blob space, and a compressed tx size of 25 bytes. This gives around 50,000 transactions per second, which seems like a worthy goal.
Table 1 in that article doesn't satisfy my internal bullshit detector, and it looks like others have debunked it as well; see the article below for an example.
In what part of the world is it typical to say "45 year engineer"? I'm an engineer in the western US, and would say "an engineer with 45 years of experience". I interact with lotsa international english; this one is new
If by "this kind of approach" you mean lattice tools, then I think the answer is yes. See the link below for an example in the Wikipedia page on the LLL. Also the second link may be helpful
Kolmogorov complexity [1] is a measure of the complexity of an object (say a text), while Cyclomatic complexity is a measure of the complexity of a program. Can we make any statements about the relationship between them?
Let's say we have a text A, and we find a program P which is of length L and which the Kolmogorov complexity K(A); i.e. L=K(A). Does it make sense to compare the cyclomatic complexity C(P) with K(A)? Or can we write some equation or inequality the compares C(P) with K(A)?
I guess a first task would be to normalize one or the other so as to get the same units...
At present the title of the article [1] is "Is American Journalism Headed Toward an ‘Extinction-Level Event’?" To which I would answer "No". That's a click-bait headline complaining about how American newspapers are moving towards click-bait journalism ;-) It even looks to me like the HN headline changed the article headline to be more click-baity.
Two examples of papers that appear to me to be thriving are the NY Times (commercial), and the Salt Lake Tribune (non-profit). Newspapers may have problems, but I don't think we can say they're going extinct.
https://github.com/chrisvwx/taxFoo.jl