davidgrenier

5 ms·

1.
by davidgrenier 15d ago
Location: Montreal Remote: Yes or Hybrid (Mtl) Willing to relocate: No Technologies: F#, C#/.NET, Clojure, Matlab, Julia, MSSQL, MySql, Math, SSRS, Mathematica, Haskell, toyed with Coq/Agda/Idris Résumé/CV:
2.
by davidgrenier 22d ago
I was assuming the event horizon would also have a donut shape around the ring singularity.
3.
by davidgrenier 3mo ago
I think he's talking about company enshittification because of marke pressure, and not direct fraud though I haven't read the book.
4.
by davidgrenier 5mo ago
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.
5.
by davidgrenier 6mo ago
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:/&#x
6.
by davidgrenier 1y ago
There's only one "other side" in this, it's the American people.
7.
by davidgrenier 2y ago
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.
8.
by davidgrenier 2y ago
I think the author is generous in granting that Caro-Cult programming works.
9.
by davidgrenier 2y ago
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.
10.
by davidgrenier 2y ago
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.
11.
by davidgrenier 2y ago
Your very last example kinda supports the thesis up there, considering how it's been going.
12.
by davidgrenier 3y ago
Correct me if I'm wrong but (log n)^O(n) sounds like atrocious complexity?
13.
by davidgrenier 3y ago
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
14.
by davidgrenier 3y ago
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 gue
15.
by davidgrenier 3y ago
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 wante
16.
by davidgrenier 3y ago
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.
17.
by davidgrenier 3y ago
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
18.
by davidgrenier 3y ago
It isn't though: https://github.com/mrLSD/riscv-fs/blob/fa039b123ded9fa0c05d0...
19.
by davidgrenier 3y ago
I think this qualifies? https://en.wikipedia.org/wiki/MMIX#Simulators_and_assembler
20.
by davidgrenier 3y ago
My understanding of this is that it is an emulator that is meant to be very clear to read.
21.
by davidgrenier 3y ago
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
22.
by davidgrenier 3y ago
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 Hop
23.
by davidgrenier 3y ago
But isn't what makes numpy efficient written in C?
24.
by davidgrenier 3y ago
Will double check both systems I have access to, thanks.
25.
People running Windows 11, are you all running Sluggish Incarnate?
18 points by davidgrenier 3y ago|26 comments
26.
by davidgrenier 3y ago
This looks brutal, for a lot of people John Reppy's book Concurrent Programming in ML (as in SML not Machine Learning) is going to be much more accessible. Pick the CSP-style library in the programming language of your choice. Go with
27.
by davidgrenier 3y ago
Pro-tip, F# has an extremely efficient CSP-style concurrency library called Hopac.
28.
by davidgrenier 3y ago
F# is extremely expressive, has algebraic datatypes and just about everything C# has to offer. It has a REPL so you can write your code interactively and make fast and safe progress. .net is practically first class on Linux now. Start your
29.
by davidgrenier 3y ago
Yes, maintaining your proficient in QWERTY is only a matter of not stopping to use it altogether when switching to a new layout. It'll just be a matter of time spent to become fluent in both. I recommend Colemak however. I personally d
30.
by davidgrenier 3y ago
I had never heard of the concept of closest average neigbor before. When I read it, I assumed it meant: draw a straight line between the two bodies, that is the current distance between the two bodies, now average it over a couple of years

More ›