606 karma · joined May 2, 2021
That is (nearly) correct under Cook reductions but not Karp reductions.
I say "nearly" because "if language L can be solved (decided) in polynomial time, then so can any problem in NP" is a vacuously true statement for any L not in P, so by this definition nearly all languages (a measure 1 fraction of them) are also NP-complete despite most of them not being in any particularly interesting complexity class.
If we escape this degeneracy by replacing the antecedent with "given access to an efficient way to decide L", then we've recreated NP hardness under Cook reductions.
Now suppose he were already invited to her domicile, but she and Bill found him annoying so they told him to either stuff it or leave. Would that violate his first amendment right? Also no.
Now replace the Clintons and Shkreli with Stanford and the protesters, respectively.
We already know that dosages above 10 micrograms/kg of body weight is carcinogenic and should be avoided, so establishing where in the 100,000-300,000 microgram/kg range the LD50 resides does nothing for us.
The same forms I ultimately generated with both TaxHawk's and H&R Block's software were identical to those I wasn't allowed to submit with FFF.
One counterpoint would be that verbosity, especially in the heavy syntax style of languages such as C++, distracts the reader and helps bugs hide in plain sight. For a silly example, imagine trying to read and verify the correctness of an academic paper from its uncompiled LaTeX source.
If those who ate too few acids found a way to induce the excretion of too many of them, then they'd be in trouble.
[1] https://opensearch.org/blog/opensearch-2-4-is-available-toda...
I don't get why vegan and vegetarian food are highlighted here. People eat plenty of packaged or highly-processed meats, too. If anything, most raw items that don't require cooking are probably vegan, and there is no shortage of low-prep ones.
I think a more accurate description would be "I don't waste my time with bad science and sealioning" (of which I accuse the article, not you).
Take the "dropped precipitously" link from the article. Does it link to an article about the before-and-after effects of the helmet mandates in Sydney in Melbourne? No. Does it talk about a drop in bicycle usage, irrespective of any relation to the mandates? Also no. It's an uninstrumented observational article about the lack of adoption (specifically) of bike share programs in several Australian cities, with no meaningful analysis of policy-based or temporal factors (outside of the changing coverage areas of the bikeshare companies). That study has zero relation to the claim for which the posted article cites it. Trying to pass it off as if it does is entirely in bad faith.
Articles like the one linked in the OP are a dime a dozen, and disregarding them based on simple heuristics is a good use of everyone's time. If one has a bold scientific claim to make, they should either present the data alongside the article in which they make the statement, or accompany it with a peer-reviewed article that does.
None of these belong in the desert, if anywhere.
The interesting bit about Turing's result is that it can be adapted to a wide class of mathematical and real objects. Physical systems? Yep. Time and/or space bounded machines? You bet. Actually, at its core Turing's result is itself an adaptation of Gödel's, who more broadly talks about the context of first-order mathematical theories.
If one want to bring these concepts to practice (where by practice I mean the realm of proving results in theoretical cs), it's a lot more effort than comparing claims to a simple sequence with an easy to derive limit. For an introductory example of the subtlety involved, while the two series (1/2 + 1/4 + 1/8 + ...) and (2 - 1/2 - 1/4 - 1/8 - ...) both approach 1 in opposite directions, most uncomputable numbers cannot be approached from both sides simultaneously (by a computably enumerable process, anyway). For example, while Chaitin's number is a definite number, you cannot write down any program whose sequence of outputs converges to it from above. They're all wrong. Comparing that to probably the most basic convergent infinite series in mathematics (that doesn't end in all zeros) is quite a disservice to the complexity and beauty of the field.
Current FAANG employee here -- how I wish this were true.