R. A. Dehi @radehi@qoto.org
I read a lot. Sometimes I learn things. I like making things. I think reading and doing are complementary.
Joined Nov 2022
R. A. Dehi
boosted
One of my pals told me my Twitter comments were as viscous as AOC and Nancy Pelosi. I though everyone’s were like that! I just got used to it. As much as you can. It’s nothing short of astounding to me that I can just post and engage on here and people respond in a way that seems normal and real. The Twitter comments world is distorted and dangerous. I don’t see how twitter can be fixed. We’re better off here. ❤️
@jwz I guess depends on whose walls you walk through, no? Surely there's times a few ghosts spying on SFPD or San Francisco City Council members could have avoided some trouble for DNA.
Birdsite
https://nitter.net/TechEmails/status/1575588277700026368 has the purported conversation between Dorsey and Musk from March about how Twitter should become "an open source protocol, funded by a foundation of sorts that doesn't own the protocol, only advances it". Purportedly the thread was made evidence in the Twitter v. Musk lawsuit.
If that's the plan, firing most of Twitter's employees does seem like a good first step.
@jwz Man, if I could walk through walls and be invisible and not have to work for a living, I tell you what, I gain all KINDS of knowledge.
R. A. Dehi
boosted
Sad news from UNC Chapel Hill Computer Science — Fred P. Brooks, the founder and long-time chair of the department (and a major influence on my professional outlook) passed away a few hours ago.
@SteveBellovin Oh no. Thank you for letting us know.
R. A. Dehi
boosted
@alcinnz Well, so, the effect of any finite-length string on a particular DFA is a finite map from possible states at the beginning of the string to resulting states at the end of the string. For the empty string it is the identity function.
You can compute the effect of a concatenation of strings by composing these maps. If you do this bottom-up on a long string, starting from all its one-character substrings and then consolidating them into a tree of substrings of length 2, 4, 8, etc., each exhaustively covering the original string, you have a log-time parallel algorithm for DFA evaluation on the string. The final step is to apply the finite map computed for the entire string to the initial state defined by the DFA.
Then, if desired, you can propagate the results back down the tree to find the state of the DFA at every character.
Is precisely the parallel prefix-sum algorithm, with the monoid operation being function composition rather than, for example, integer addition.
Does that make sense? I don't know how to evaluate the clarity of my explanation in part because I don't know how familiar you are with the background.
R. A. Dehi
boosted
"The whole problem with the world is that fools and fanatics are always so certain of themselves, but wiser people are so full of doubt." – Bertrand Russell, paraphrased from The Triumph of Stupidity”, Mortals and Others: Bertrand Russell's American Essays, 1931-1935
https://twitter.com/MNateShyamalan/status/1592287177542696963
@jeffjarvis Musk? Sure. The question is what is there after that. It still has a quarter billion daily active users; they won't disappear overnight, even if Twitter spends a week in the Fail Whale.
@freemo Of course not, it's full of 60s self-esteem rhetoric.
@abde RAII, the STL, arguably exceptions, and debugging other people's C++ code
Twitter nonsense
@mmasnick It sort of makes sense; certainly a lot of people don't think he should be in control of Twitter, including a lot of people who actually work at Twitter. Purges and unpredictable changes are par for the course when ruthless power struggles are afoot, and power (rather than profits) seems to be what Musk is after with his Twitter takeover, as he said in his TED interview. It remains to be seen how works out.
@mattblaze Yeah, it's pretty annoying.
@atomicpoet Hmm, sounds like I misinterpreted your post.
Twitter implosion
@mattblaze It'll be interesting to see what the new Twitter looks like six months from now.
@atomicpoet minor quibble, HTTP didn't exist until a decade after the internet's infancy
@alcinnz Sure, naturally.
@alcinnz It has some similarities to Tomasulo's algorithm, but Tomasulo's algorithm isn't SIMD.
@alcinnz A thing I've been thinking about for a while is heavy multithreading by enqueuing execution states in per-opcode queues, so that you can then do SIMD (or SIMT) execution of a single opcode in 64 or 128 concurrent execution states at once.
I read a lot. Sometimes I learn things. I like making things. I think reading and doing are complementary.
Joined Nov 2022
