@harudagondi I find it helps to write some clients for the API first. Even unit tests can be good.
@lxo No, I still think it'll be very interesting to see what looks like six months from now!
@atomicpoet @mmasnick If Twitter collapses like Digg did, maybe it will prevent the Unitedstatesans from re-electing Trump? Is hard to imagine the necessary degree of insane polarization being sustainable on YouTube, Instagram, and Facebook alone. Maybe the alt-right will collapse too.
@jwz Also can these ghosts do Reed-Solomon coding?
"[Lossless Convexification of Nonconvex Control Bound and Pointing Constraints of the Soft Landing Optimal Control Problem](http://larsblackmore.com/iee_tcst13.pdf)", #controltheory paper by Behçet Açıkmese, John M. Carson III, and Lars Blackmore, the guy who got the #SpaceX rockets to land on their tails like CGI special effects.
Abstract: "*Planetary soft landing is one of the benchmark problems of optimal control theory and is gaining renewed interest due to the increased focus on the exploration of planets in the solar system, such as Mars. The soft landing problem with all relevant constraints can be posed as a finite-horizon optimal control problem with state and control constraints. The real-time generation of fuel-optimal paths to a prescribed location on a planet’s surface is a challenging problem due to the constraints on the fuel, the control inputs, and the states. The main difficulty in solving this constrained problem is the existence of nonconvex constraints on the control input, which are due to a nonzero lower bound on the control input magnitude and a nonconvex constraint on its direction. This paper introduces a convexification of the control constraints that is proven to be lossless; i.e., an optimal solution of the soft landing problem can be obtained via solution of the proposed convex relaxation of the problem. The lossless convexification enables the use of interior point methods of convex optimization to obtain optimal solutions of the original nonconvex optimal control problem.*"
@ilpincy @abde I think a lot of the programming language design space remains unexplored. In large part is because many of the big wins at the language level happened early (named variables, automatic jump address calculation, infix expressions, conditionals, functions, garbage collection, dynamic typing) and, except for experimentation, reuse commonly trumps potential linguistic advantages.
To be concrete, is better to use OpenCV than to reimplement it in a better language.
I've been using #AnnotatedEquations in my recent papers. I think it really adds to the readability and understanding of the math.
Here are some examples. It uses #tikz in #latex.
Let me know if you like it. Happy for any feedback.
@AccordionGuy I see, thanks!
@AccordionGuy Hmm, will 5000 hurried people make that much of an impact on the healthcare system of a city of 750k? And I think the whole SFBA is almost ten million.
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.
@SteveBellovin Oh no. Thank you for letting us know.
@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.
"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.
I read a lot. Sometimes I learn things. I like making things. I think reading and doing are complementary.