orlp

36 ms·

451.
by orlp 4y ago
Well, for example the libs/container/src/linked_vector.rs is very overcomplicated and fragile using unsafe code. Ultimately what you want is for references to remain stable on push/pop, which can be achieved simply with
452.
by orlp 4y ago
Yes... At the risk of being accused of claiming No True Scotsman, the implementation really doesn't seem like Rust to me. I would expect an idiomatic implementation to drastically go down in lines of code... while compile times probabl
453.
by orlp 4y ago
Well, yes and no. In certain games you do gain an advantage this way over a classical opponent, it's called quantum pseudo-telepathy: https://en.wikipedia.org/wiki/Quantum_pseudo-telepathy . It sounds like quackery
454.
by orlp 4y ago
The claim I find objectionable is that brains do 'hypercomputation', and can not be ran on a Turing machine.
455.
by orlp 4y ago
> stating human brains are actually hypercomputers, which cannot be implemented in real life at the moment Extraordinary claims require extraordinary evidence, and absence of evidence is not evidence of absence.
456.
by orlp 4y ago
That works until you end up with one scholar saying A and another saying B.
457.
by orlp 4y ago
And note that for example on Apple M1 it's essentially impossible to beat an implementation that uses Apple's Accelerate library for things like matrix multiplication, because Apple uses undocumented instructions unavailable to th
458.
by orlp 4y ago
The arsonist fireman might seem like a lifesaver if you aren't aware he is the one that put your house on fire.
459.
by orlp 4y ago
> (Yes, a 1.5 mile journey to school, we should be walking) You should be cycling.
460.
by orlp 4y ago
I always have a program open that's called pcalc as well, but it's something homebrew and short for Python calculator. It's just a Python repl (enhanced by python-prompt-toolkit) with a bunch of my own pre-defined functions:
461.
by orlp 4y ago
For the longest time we (and in many places probably still do) literally taught students multiplication tables . That is, hardcoded answers for a * b with a, b <= 10. As soon a double digit integers are involved - tough shit.
462.
by orlp 4y ago
This is a perfect description for most of Jacob Collier's music for me.
463.
by orlp 4y ago
Not really, that is solved with aliases. The problem really comes to life when using strongly typed generic functions that must be generic over their return type. This most notably occurs with Rust iterators. Try writing out the type of thi
464.
by orlp 4y ago
I've never even looked at the poem and have beaten Minecraft many times. I'm probably not the target audience though, I generally skip quest text in games.
465.
by orlp 4y ago
This can overflow for signed integers.
466.
by orlp 4y ago
My day 22 solution runs in <10ms: https://github.com/orlp/aoc2021/blob/master/src/bin/day22.rs The trick I used was to represent signed volumes, compute the intersection and then store the &
467.
by orlp 4y ago
My 2021 day 23 runs in 5 milliseconds for both parts using A* with a custom heuristic: https://github.com/orlp/aoc2021/blob/master/src/bin/day23.rs
468.
by orlp 4y ago
> Hoi Peter, A nitpick, but my name is Orson Peters, Peters is my last name :) > I assume that's one of the advantages of building upon powersort? The blocky nature of quadsort is both a blessing and a curse in that regard. I don
469.
by orlp 4y ago
Hi Igor, > It should be O(n log n) comparisons and technically O(n (log n)^2) moves. Yes, the same applies to glidesort. Looking at your repository again more carefully you do indeed only claim O(n log n) comparisons , I was not careful
470.
by orlp 4y ago
Schoolbook exchange quicksort isn't stable, but quicksort absolutely can be implemented stably, which I do in glidesort: https://www.youtube.com/watch?v=2y3IK1l6PI4 .
471.
by orlp 4y ago
Hello, author of glidesort (and for context, pdqsort) here. No it's not released yet but it's getting real close. The code is virtually done, with some minor cleanup required. Besides some personal stuff, a large source of my dela
472.
by orlp 4y ago
Web discoverability was solved and then unsolved once again by endless SEO.
473.
by orlp 4y ago
> It's extremely simple, and breaks down the most complex networks into 4 OpTypes: > > - UnaryOps operate on one tensor and run elementwise. RELU, LOG, RECIPROCAL, etc... > - BinaryOps operate on two tens
474.
by orlp 4y ago
Our world is near-limitless in bandwidth, but highly restrained in cache size and latency. 10x compression means you can keep 10x more stuff in cache. And it doesn't matter what level you operate on, cache and latency is always relev
475.
by orlp 4y ago
> One might envision some language environment that can track taint-style the flow of data through an application, but this seems beyond state-of-the-art. World of Warcraft has had this in its addon system for over 15 years: https:&#x2F
476.
by orlp 4y ago
> But checking lengths doesn't really help you: it only tells you when strings are not equal, and you would still have to walk the string to see which one is larger/smaller. Only for a three-way comparison. If all you care abou
477.
by orlp 4y ago
> Disputing that feels more and more like disputing global warming being a thing. There's a reason I started my comment with "I do not claim that evolution is the reason for the reduction in dead bugs". I was just nitpicki
478.
by orlp 4y ago
> Also, the "bugs evolve away" would need evolutionary pressure being involved I do not claim that evolution is the reason for the reduction in dead bugs, but if "go near road" has a increased risk of death due to aut
479.
by orlp 4y ago
Maybe "it's no surprise" is a poor choice of idiom in this context in hindsight.
480.
by orlp 4y ago
That's because the infinite sum of F(n) x^n, also known as its generating function, is x/(1 - x - x^2). If you substitute x = 10^-1 you get 10/89, but also F(1) 10^-1 + F(2) 10^-2 + F(3) 10^-3 + F(4) 10^4 + F(5) 10^5 +

More ›