davidgrenier

先月議論

I think he's talking about company enshittification because of marke pressure, and not direct fraud though I haven't read the book.

davidgrenier

3 か月前議論

Yeah I guess two companies who would otherwise be considered going for bankruptcy have models too expensive to run. As they don't see themselves making money any time soon, they have to turn every future model into a weird fascination.

davidgrenier

4 か月前議論

I wonder how gracefully redgrep handles this. This tool hasn't been talked about since the year of its release. If I recall correctly, it doesn't handle some obstruse regexes the way conventional tools do however.

https://github.com/google/redgrep

davidgrenier

昨年議論

There's only one "other side" in this, it's the American people.

davidgrenier

2 年前議論

v4l2-ctl on linux allows me to change such settings on a global level, maybe that might work if a version can be found on his OS.

davidgrenier

2 年前議論

I think the author is generous in granting that Caro-Cult programming works.

davidgrenier

2 年前議論

I haven't looked at Hardy's but the presentation in Spivak is also Dedekind cuts. Perhaps Hardy uses a different approach and OP misnamed it? Rudin's chapter 1 annex also use Dedekind's cuts.

davidgrenier

2 年前議論

Where we define the real numbers as the least upper bounds of special sets. There is a bijection between these sets and the set of real numbers which we commonly think of and that bijection is the least upper bound of such sets.

davidgrenier

2 年前議論

Your very last example kinda supports the thesis up there, considering how it's been going.

davidgrenier

2 年前議論

Correct me if I'm wrong but (log n)^O(n) sounds like atrocious complexity?

davidgrenier

2 年前議論

LP or ILP? There is a significant difference since for non-discrete problem Linear Programming is shockingly efficient and in no way can be considered a brute force technique.

edit: What would be a technique you consider non-brute force in discrete problems?

davidgrenier

3 年前議論

I was speculating two oscillators with periods p and q could be composed (as long as there was no way for them to interact) to create an oscillator of period p*q/gcd(p,q) but wondering why large primes wouldn't be a problem.

I guess this is my answer.

davidgrenier

3 年前議論

I think his argument was restricted to a human-produced mathematical result being ported to a Lean program where one would be just as likely to commit a mistake. However I disagree as well, I recall the difficulty of expressing what I wanted to Coq being a barrier to expressing it incorrectly.

davidgrenier

3 年前議論

Good teacher, his Number Theory book felt really good though I have no comparable in Number Theory. I must say Number Theory and Combinatorics are the most difficult topics I got acquainted with in undergrad.

davidgrenier

3 年前議論

Bouty makes excellent chair. Looking at their website I'm thinking Arista/Kadera/Fira. The model of chair I have doesn't seem front page but it is the Sity 9002.

The piston gave after 10+ years of service. Contacted them, warranty is for life, they had someone show up and replace it for free.

davidgrenier

3 年前議論

It isn't though: https://github.com/mrLSD/riscv-fs/blob/fa039b123ded9fa0c05d0...

davidgrenier

3 年前議論

I think this qualifies?

https://en.wikipedia.org/wiki/MMIX#Simulators_and_assembler

davidgrenier

3 年前議論

My understanding of this is that it is an emulator that is meant to be very clear to read.

davidgrenier

3 年前議論

Someone mentionned in the Mastodon thread that they have an Android phone with nothing-from-google on it. I speculate his installation is even more responsive than whatever default the product came with and I'd like to do that.

I have a terrible Vankyo Z1 table that is very slow. Where do I start?

davidgrenier

3 年前議論

Note that lightweight threads (even in CSP style concurrency model) can be even lighter and faster. F#'s Hopac library seems to meet such expectations with this simple program:

   #r "nuget:hopac"

   open Hopac
   open Hopac.Infixes
   open Hopac.Extensions

   seq{1..1000000}
   |> Seq.Con.iterJobIgnore (fun _ -> timeOutMillis 1000)
   |> run

Runs in 1.824s real, 17.635s user and 0.088s system time in under 186000KB, hence less around 200 bytes per thread.

10M threads sleeping 10 seconds taxes this machine to:

22s real, 4m user, 0.506s system @ 140 bytes/thread.

davidgrenier

投稿

People running Windows 11, are you all running Sluggish Incarnate?

Freedom from the Known

Ask: Has Microsoft spent your trust

Ask HN: Testing in production after deployment

コメント