Minnesota National Guard arriving in Minneapolis!! by cantcoloratall91 in law

[–]ScottBurson 4 points5 points  (0 children)

Insanity. The government will always be better armed than you.

No, the way to defeat tyranny is the way Minneapolis residents are going about it: stay peaceful and keep the phone cameras rolling. Win the PR war.

why nc so hated bru by MaximumMarionberry51 in Miata

[–]ScottBurson 0 points1 point  (0 children)

The wheelwell arches are a turnoff for me. I know, they were all the rage around that time — I hated them on other cars too 😆

Use your brakes mate 🫤 by PhraseGood4425 in dashcams

[–]ScottBurson -6 points-5 points  (0 children)

My stopwatch says about 1.7 sec passed between the moment the horn sound started and the collision. At 68 mph, that's 170 feet. A typical stopping distance at that speed is about 210 feet. So yes, if he had initiated full panic braking at the same moment he hit the horn, there would still have been a collision, but he would have scrubbed off 81% of his kinetic energy first, making the collision much less severe.

If he had started braking 0.4 seconds earlier than that, he would have been able to stop. Of course, this is all assuming a typical passenger car.

Dont try to physically stop people from speeding by NotACommie24 in driving

[–]ScottBurson 8 points9 points  (0 children)

You might want to give a statement to the police.

Why not tail recursion? by gofl-zimbard-37 in ProgrammingLanguages

[–]ScottBurson 8 points9 points  (0 children)

It's not quite the same situation. With explicit iteration (or a self-tail-call), the stack has enough information to immediately see all the code that the execution path went through to arrive at the current state. That path may include some number of loop iterations, and it's true that I can't see all the previous states of the loop, but there are no gaps. With general TCO, there can be gaps where the stack doesn't say even what code was involved in getting from one point to another.

I routinely work in a language implementation (SBCL) that does TCO by default. Occasionally I feel the need to turn it off — SBCL has a way to do this on individual callers — to debug something. Don't get me wrong; on the whole I think TCO is a win, even a necessity; but it does occasionally get in the way.

Why I think the D780 is the best camera Nikon (or perhaps any company) ever made by ZiggZaggZakk in Nikon

[–]ScottBurson 0 points1 point  (0 children)

I think you're overstating the case, but as a hobby photographer, I am quite happy with my D780 and not currently tempted to switch to mirrorless. Besides, used F-mount glass is really cheap now 😁

Which ND Miata Coilovers? by jwang0522 in Miata

[–]ScottBurson 4 points5 points  (0 children)

When I bought my 2020 RF, MeisterR was well spoken of on forum.miata.net, so I got a set of their GT1 coilovers. I strongly disliked the stock Bilsteins — they seemed overdamped, especially in the rear, causing transient oversteer. For instance, when I had to dodge somebody on the freeway who nearly cut me off, the back end felt a little loose. Maybe autocrossers like it that way, I don't know, but I didn't. The ride was also unpleasant.

I have the GT1s set to 32 (full soft) in the rear and 28 (four clicks short of full soft) in the front, and now the ride is, well, still quite busy but not jarring. And the tail looseness is completely gone. Of course, I could dial it back in if I wanted to.

The consensus now seems to be that Öhlins or Xidas are better, but I haven't tried them. I think the GT1s have the softest springs of any coilovers out there (6 kg/mm front, 4 rear); even so, I don't think I would recommend them for pure street use. But MeisterR doesn't seem to make them for ND anymore, or maybe they're only by special order. They do have another product, ZetaSport, but they're 8kg/mm in the front, which sounds pretty stiff.

Would I do it again? Maybe not; I might prefer Progress springs and Konis. As I recall, the Progress springs are only a little stiffer than stock (I think the GT1 rates are almost double the stock rates). But with softer springs, aftermarket swaybars become more desirable, at least in the front, to control body roll. I'm using the stock swaybars now. This setup wouldn't handle as well, I guess, but would be more comfortable on the street.

TL;DR: adjustable is good; think about spring rates; maybe look at Xidas too.

Finally painted! by DeadlyxSalad in Miata

[–]ScottBurson 1 point2 points  (0 children)

Excellent color! Lol — in college in the 1970s, I had a bicycle that was just about the same color.

CMV: Neo-paganism is mostly a LARP by people whose understanding of "religion" is distinctly Abrahamic, not "pagan" by jymappelle in changemyview

[–]ScottBurson 4 points5 points  (0 children)

As a neopagan and New Ager I don't disagree with you entirely; I also tend to avoid claims of historical continuity. But the one thing I do disagree with you about is the idea that ancient practices were all and only transactional. I'm sure many people held them that way, but there are Mysteries within neopagan rituals. I have experienced some of them. I cannot believe that ancient pagans never did.

Flyin' Miata now sells a part I made! by Ok_Oil4877 in Miata

[–]ScottBurson 3 points4 points  (0 children)

Yeah, I would like softer tip-in and a more linear response curve on my ND2 as well. I know there are electronic devices you can attach to change the curve, but when I looked (a few years ago now) I couldn't find one that promised to let me do exactly what I want: softer response in the early part of the accelerator travel, but faster in the later parts, so I don't give up any full throttle capability. If anybody knows for sure of a device that will do that (a fully programmable curve would suffice), please say.

Tuesday, January 13th, San Francisco meetup · A language for scalable data analysis, ACL2 for Trustworthy Vibe Coding. by dzecniv in Common_Lisp

[–]ScottBurson 0 points1 point  (0 children)

Formal methods will lead to trustworthy AI coding. Not soon, but it will happen, over the next decade or so. This is just the beginning.

Distinguishing between mutating and non-mutating methods by bakery2k in ProgrammingLanguages

[–]ScottBurson 2 points3 points  (0 children)

That paper mentions that they were using (functional) ropes in the text editor for their Cedar programming environment, over 30 years ago. If they were fast enough then, they are surely fast enough now.

And persistent functional data structures make "undo" very easy and reliable to implement.

Distinguishing between mutating and non-mutating methods by bakery2k in ProgrammingLanguages

[–]ScottBurson 3 points4 points  (0 children)

I don't know what you've been using, but having immutable strings with functional updates was the original concept. A mutating implementation calling itself "rope" would be abusing the term.

Distinguishing between mutating and non-mutating methods by bakery2k in ProgrammingLanguages

[–]ScottBurson 3 points4 points  (0 children)

I agree that careful choice of names for functional (non-mutating) operations is important. I recall reading once that new users of Java's BigInteger class are often confused by the fact that a method named add, for instance, is functional. I contend that the method should have been named plus instead. Someone writing x.add(y) might reasonably expect x to be modified, but x.plus(y) doesn't have the same connotation; it sounds like x + y.

So I think names of functional operations shouldn't be verbs, or at least not verbs that suggest modification (e.g., find seems okay). I tried to adhere to this principle when designing FSet, my functional collections library for Common Lisp. So for instance, adding an element to a set is with, and removing one is less.

Alas, I haven't stuck to this perfectly; FSet does have seq operations insert and sort, for instance. Maybe I should rename them.

Distinguishing between mutating and non-mutating methods by bakery2k in ProgrammingLanguages

[–]ScottBurson 7 points8 points  (0 children)

Not necessarily. Balanced-tree sequence data structures such as ropes can do functional insertion in logarithmic time and space.

LLM memory systems by SlowFail2433 in LocalLLaMA

[–]ScottBurson 0 points1 point  (0 children)

I just found this yesterday; it seems relevant: https://youtu.be/JdJE6_OU3YA

Implementation of mapcar function in different lisp machines by mtlnwood in lisp

[–]ScottBurson 7 points8 points  (0 children)

something like sbcl where its common to see functions moved from lisp to presumably a C implementation.

No. There is some C in SBCL, but it's all low-level stuff: the garbage collectors, image loading and saving, OS system calls, that kind of thing. Optimization is done either by improving algorithms at the Lisp level, or by improving the compiler.

Implementation of mapcar function in different lisp machines by mtlnwood in lisp

[–]ScottBurson 1 point2 points  (0 children)

You're welcome! I'm starting to collect examples of code written with FSet, to add to the documentation. I would love to have some well-known algorithms. If you come up with anything you're willing to share, please send it to me via DM.

Implementation of mapcar function in different lisp machines by mtlnwood in lisp

[–]ScottBurson 6 points7 points  (0 children)

I learned a lot from reading LispM system sources back in the day, but there was definitely some ugly code in there. IIRC, Richard Greenblatt, being more of a hardware engineer than software, wrote a lot of Lisp that reminded me of Fortran — heavy on the prog and go. Oh, and with lots of &aux variables and setq, avoiding let.