ogogmad

21 ms·

391.
by ogogmad 2y ago
Is there a way to implement matrix arithmetic with nice syntax (for instance, "A + B" to add two matrices A and B) in Gleam? The lack of ad-hoc polymorphism might paradoxically be a blessing.
392.
by ogogmad 2y ago
Are there GUI builders like for VB6, but for IMGUI libraries?
393.
by ogogmad 2y ago
What about the 6-monthly and 2-yearly forced upgrades? How are you faring with those?
394.
by ogogmad 2y ago
Dijkstra was advocating for using formal methods... Do the people agreeing with the article agree with its actual point? Especially whether it was wise before AI (maybe) improved the practicality of such an undertaking?
395.
by ogogmad 2y ago
Holy shit that's slick. Wow. You have to verify though that the Hamiltonian cycle exists. An induction proof seems to do the job.
396.
by ogogmad 2y ago
> Pretending that this can be given a denotational semantics is the charlatanism by which AI zealots also claim the world is some abstraction. Huh?
397.
by ogogmad 2y ago
Why are there always these smug "Dijkstra's right that everyone else is an idiot" replies to Dijkstraposts? Do people understand exactly what Dijkstra was advocating for? > I have met some developers in my career that can
398.
by ogogmad 2y ago
Note that in the adjacent case, a nice recursive algorithm can solve the problem. What's the general solution in the random non-adjacent opposite-colour case, out of only the slightest curiosity?
399.
by ogogmad 2y ago
Where do blogs, twitter, chat rooms, etc fit into all of this? They are yet more options we have now.
400.
by ogogmad 2y ago
Interestingly, there's a close connection between the "Fundamental Theorem of Galois Theory" and the "Fundamental Theorem of Covering Spaces".
401.
by ogogmad 2y ago
I don't think this is Galois theory. Galois theory is about "The Fundamental Theorem of Galois Theory", which states that there is a nice mapping from field-extensions to group-extensions, where the resulting groups are usual
402.
by ogogmad 2y ago
Tl;dr reason: RSA requires larger key sizes, which makes it slower. ECC makes cryptanalysis more complicated, so the keys can be made smaller, which makes it faster.
403.
by ogogmad 2y ago
You need to correct the 2nd sentence to say that V and V** are naturally isomorphic. V and V* are only unnaturally isomorphic. All of this holds only in finite dimensions, of course.
404.
by ogogmad 2y ago
The mathematical definition is 99% equivalent to the physical one. I find that the physical one helps to motivate the mathematical one by illustrating the numerical difference between the basis-change transformation for (1,0)- and (0,1)-ten
405.
by ogogmad 2y ago
Any connection to Blitz Basic or Blitz 3D?
406.
by ogogmad 2y ago
Your comment sounds elitist but maybe I'm wrong -- how do we judge what's populist bullshit and what's rightly acclaimed?
407.
by ogogmad 2y ago
The arctan has the advantage that it's differentiable infinitely many times over R.
408.
by ogogmad 2y ago
No. There's literally an article on Computable Analysis, and it details Type Two Turing Machines.
409.
by ogogmad 2y ago
A weaker but easier result is that the differentiation operator is uncomputable: Define f_t(x) = t arctan(x/t). As t -> 0, f_t -> 0. But notice that f'_t(0) = 1. By contrast, the integration operator is computable. Why? Beca
410.
by ogogmad 2y ago
> A much simpler version is f'(x) = {-1 if x<0; +1 if x>0; Chaitin's constant if x=0}. f(x) = abs(x). This is wrong. The function f you've defined is not continuously differentiable. The one in Myhill's paper
411.
by ogogmad 2y ago
> It is already known that a computer with access to real numbers with infinite precision can perform hypercomputation I took an interest in this area once, and this is not true. "Computable analysis / computable topology"
412.
by ogogmad 2y ago
this would be so much easier in German
413.
by ogogmad 2y ago
Some machine learning models might be more interpretable than others. I think the recent "KAN" model might be a step forward.
414.
by ogogmad 3y ago
Correlation? What are you measuring, if I may ask?
415.
by ogogmad 3y ago
> I suspect it is still hard for LLMs I just gave it to Claude: https://imgur.com/a/fQQOy1d
416.
by ogogmad 3y ago
Oh my God, here we go again. WHICH VERSION of chatgpt did you use?
417.
by ogogmad 3y ago
If Gleam is imperative by your logic, then Scheme and the whole ML family (SML, OCaml) would be imperative as well. That's a strange choice of semantics. Even Haskell has unsafePerformIO, which it might sadly need.
418.
by ogogmad 3y ago
Do any lisps support the interactive style of programming CL is famed for, apart from CL itself? I think resumable exceptions are an important part of it.
419.
by ogogmad 3y ago
Did you ever get lots of cuts near the Adam's apple?
420.
by ogogmad 3y ago
> I don't need some fear based faith system keeping me in check. Maybe others do?

More ›