schoen

38 ms·

481.
by schoen 2y ago
Maybe not strictly impossible, just slightly better than an ultramarathon world record pace? https://www.reddit.com/r/Ultramarathon/comments/xhbs4d/sorok... https://en.wikipedia.org/wiki&
482.
by schoen 2y ago
We may be lucky that it didn't work. It appears from GNU units that printing this all out on paper would be about a hundred solar masses. Maybe about fifty solar masses if you print double-sided.
483.
by schoen 2y ago
I clicked on this assuming it was going to be my home town, Northampton, Massachusetts (obviously named after the original Northampton). After a long gap there is now passenger rail service to that Northampton again. https://www.
484.
by schoen 2y ago
Here's a video of him performing it live that I found with a YouTube search: https://www.youtube.com/watch?v=2xmRWj7gJEU But it's presumably not the same one that you saw, since it doesn't show any signs of b
485.
by schoen 2y ago
I guess in principle Tim Bray would have been in a better position to help people figure out why their XML files aren't working than Daniel Sternberg would be to help people figure out why a Cisco product isn't working, though!
486.
by schoen 2y ago
"Tlön, Uqbar, Orbis Tertius" as I understand it is more ambiguous about exactly why Tlön is becoming real in the narrator's world. Although there is a description in the afterword of such a guild having fabricated Tlön and so
487.
by schoen 2y ago
One funny thing about Mersenne primes is that, as a result of what you describe, they are exactly those primes whose binary representation consists of a prime number of ones! The smallest Mersenne prime, three, is binary 11, while the next
488.
by schoen 2y ago
It means "left shift" in binary. This corresponds to adding a specified number of zeros at the end of the binary representation of the original number. So 1 << 0 is binary 1, 1 << 1 is binary 10, 1 << 2 is binar
489.
by schoen 2y ago
This research definitely views it as a threat to the interests of the computer owners, because attackers can use it to hide malicious behavior better. It's just that it's cool and interesting to explore how and why. It's not
490.
by schoen 2y ago
I don't think there would have been a straightforward way to connect that to the effects of censorship.
491.
by schoen 2y ago
By the way, the original adage from John Gilmore ("The Net interprets censorship as damage and routes around it") was referring to a behavior of Usenet rather than of the Internet. In particular, if articles didn't reach a no
492.
by schoen 2y ago
How have power and cooling been doing with respect to chip improvements? Have power requirements per operation been coming down rapidly, as other features have improved? My recollection from PC CPUs is that we've gotten many more opera
493.
by schoen 2y ago
Looking at the linked references, I'm not sure what else is being assumed to be available or not available when considering proofs using the Church numerals. I guess that will matter a lot, and I don't know enough to make more gen
494.
by schoen 2y ago
I think you could prove 0 ≠ 1 if you had some other concrete fact about inequality to make use of. You could reason from the theorem "f = g -> f x = g x" to create your inequality fact on the right side and then take the cont
495.
by schoen 2y ago
(2018)
496.
by schoen 2y ago
I'd say Douglas Adams novels are full of superintelligent and/or superpowered entities that don't always think things through properly. There's a serious Murphy's Law flavor to his scenarios, even if you're the
497.
by schoen 2y ago
Other commenters are completely right to mention his concern for proofs and the "Cruelty of Really Teaching Computer Science", but the most BASIC-specific thing that he was associated with was criticism of the GOTO statement. htt
498.
by schoen 2y ago
In the font on my phone it looks confusingly reminiscent of Hebrew vav.
499.
by schoen 2y ago
I wonder if there's a tool to create dependency graphs for these dbus and polkit interactions, ideally to better audit those that seem to cross interesting trust boundaries.
500.
by schoen 2y ago
> I imagine they will also advise friends and family They will definitely advise friends and family, although they may not have the proverbial silver bullet.
501.
by schoen 2y ago
With a lot fewer zeroes!
502.
by schoen 2y ago
Or by finding them in one of the lists of largest known primes. :-)
503.
by schoen 2y ago
Not using primes anywhere near the range of the largest-known ones. The primes in your RSA keys are likely to be 1024-bit primes, or about 308 digits.
504.
by schoen 2y ago
> Almost any unproven mathematical conjecture, e.g. a program that searches for counterexamples to the Riemann hypothesis. This is a very good example. We don't know whether such programs will ever stop, and knowing is exactly equiv
505.
by schoen 2y ago
> E.g. Collatz conjecture offers such a program that does not even require a colossal state to track during execution, its state is one integer. Hence exactly as large as an infinite array of integers! https://en.wikipedia.org
506.
by schoen 2y ago
Context for readers from countries where this isn't an issue, or anyone who hasn't followed decongestant news: one of the most effective decongestants is called pseudoephedrine. https://en.wikipedia.org/wiki/P
507.
by schoen 2y ago
Yes, it's interesting how careful you have to be with what you can and can't do with negations. For example, some forms of De Morgan's Law work but some don't! These are valid intuitionistically: (P /\ Q) ->
508.
by schoen 2y ago
Yes, apparently the "leak" is a demo of the model rather than the model weights? I would have expected the latter from the headline.
509.
by schoen 2y ago
Here is a quick and dirty Coq proof (which I'm sure could be simplified and cleaned up in various ways). Theorem foo: forall P Q: Prop, (P -> Q) /\ (~P -> Q) -> ~~Q. Proof. intros. destruct H. assert (~Q
510.
by schoen 2y ago
You can conclude "not not B", which is also called "B is irrefutable". Irrefutability is like a weaker version of "true" in constructive logic that means "could be assumed without introducing a new contrad

More ›