davidgrenier

Joined 12 years ago

Karma

388

Submissions

271

Member since

Apr 26

View on Hacker News

Recent submissions

Comment · 2 months 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: https://drive.google.com/file/d/1tbFMmm4fVr1De3lAnNL-dam2UHm_-s0m/view?usp=drive_link
  Email: See résumé.

I'm looking to get involved in any form of software delivery of applied mathematics. My F# experience in backend and concurrent programming is serious and am comfortable being product owner/architect in such a context. I need to be absorbed in difficult problems for extended periods of time.

French CV: https://drive.google.com/file/d/1PxHYlKDyaEnFapnkFIUMP6xVj8M...

Comment · 2 months ago

I was assuming the event horizon would also have a donut shape around the ring singularity.

Comment · 4 months ago

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

Comment · 6 months 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.

Comment · 7 months 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://github.com/google/redgrep

Comment · 1 year ago

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

Comment · 1 year 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.

Comment · 1 year ago

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

Comment · 1 year 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.

Comment · 1 year 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.

Comment · 2 years ago

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

Comment · 2 years ago

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

Comment · 2 years 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 discrete problems?

Comment · 2 years 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 guess this is my answer.

Comment · 3 years 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 wanted to Coq being a barrier to expressing it incorrectly.