boothby

23 ms·

361.
by boothby 5y ago
Thanks, for the answer, and for maintaining the coolest website on the net. Keep up the good work!
362.
by boothby 5y ago
I'm trying to understand how they read out that BCROS memory. From the picture, it appears to be a single layer of copper on a mylar sheet. How did they get the bits out?
363.
by boothby 5y ago
> is there a valid image, that also happens to be a valid executable, that when run, outputs the image? Yes, this exists: https://codegolf.stackexchange.com/a/23255
364.
by boothby 5y ago
Neat! I came up with a similar statistic (3.65 average moves, hard mode, no failures) using a very simple heuristic. 1) pick a first guess, and partition the remaining words by the hints that they give 2) given any part of a partitio
365.
by boothby 5y ago
Thanks! I've found other sites for folks doing aqua-bonsai... I'm not taking it too seriously, at this point. It's easier for me than dirt, because I can tell at a glance if my poor plant needs water... oh dear, it does...
366.
by boothby 5y ago
I've got a brown thumb too, but I've started playing "doctor bonsai" with the seedlings that I uproot while weeding. And to be honest I only 'weed' trees because I don't want big problems in my very small
367.
by boothby 5y ago
That's the serial implementation, which is clearly O(n^2). The systolic algorithm runs in linear time on specialty hardware (similar to a tensor core, which can do comparisons in a square matrix, and can perform row-sums). Or, if we
368.
by boothby 5y ago
It's perversely linear with respect to the largest element in the array, if that's greater than the runtime of the underlying heapsort. Good luck with negative entries. Response to dead comment: > Couldn't this be solved
369.
by boothby 5y ago
I recently found a fun linear-time systolic sorting algorithm. I'd describe the serial implementation as unconventionally obvious. It's like insertion sort, without all the bother of swapping. def index_sort(a): n = len(
370.
by boothby 5y ago
I work with physicists and circuit designers. To us, "whiteboard" is synonymous with freeform drawing...
371.
by boothby 5y ago
I thought I had a pretty good handle on Python internals, until some time early this year when I took an interest in the generated bytecode. I'd read plenty of the cpython source, written lots of cython extensions, etc., but somehow m
372.
by boothby 5y ago
Fiddlers don't always tune in fifths. There's a couple of tunes I play in DDAD, my favorite for its three octaves of awesome resonance. Classical violinists tend to sneer at such tunings, outside of rather esoteric baroque playe
373.
by boothby 5y ago
I didn't know anything about compilers, but I figured out how to compile Piet programs, so I wrote a compiler[1]. The project has stalled out for (a) lack of free time and (b) some silly ambitions, but I don't care what the pub
374.
by boothby 6y ago
Their .pyx implementation leaves much to be desired. Among other problems, the hot loop uses an untyped python list. Also, they're indexing into the list instead of iterating over the list. In creating the list, they're using .
375.
by boothby 6y ago
This is largely a test of cython, but why doesn't it use the cython features comparable to Julia's? Specifically, you can achieve parallelism with prange(..., nogil=True) and no-copy with cython.view.array. https://git
376.
by boothby 6y ago
The language, where a machine starts with a list of symbols +.<>],[!- and accepts two instructions p and q which apply the permutations (+-)(,.)([])(<>) or (!.<[+>],-) respectively and executes the brainfu
377.
by boothby 6y ago
Real talk, my mom plays bass. We fit that, two adults, two kids, a pair of fiddles and backpacks for a weekend away: all into a Geo Metro. The trick is to put the neck down between the drivers with the rear seats folded down, and then fol
378.
by boothby 6y ago
Esolang nerds will recognize befunge as a 4-way machine, and Piet as an 8-way machine.
379.
by boothby 6y ago
> And we've resisted having per-module pragmas, so maybe it's dead in the water. There's a hack for that (no apologies for the self promotion; the project is a just funnin') https://github.com/boothby&
380.
by boothby 6y ago
Glad I wasn't the only one! I could probably shoehorn a cuda backend into repiet... but I don't even know where to start on generating optimized code from this horrible stack-based language.
381.
by boothby 6y ago
At your age, I had a similar feeling as the pictures from Spirit and Opportunity started rolling in. Quit my cushy but relatively dead-end web dev job, and went back to school. Busted my ass, got the grades, and found a love for math, but
382.
by boothby 6y ago
https://www.dwavesys.com/sites/default/files/14-1002A_B_tr_B... Granted, factoring isn't the best use of our hardware, but as of 4 years ago, we were hitting 80% success rate on 10-bit semiprimes without
383.
by boothby 6y ago
I'm not familiar enough with our calibration code to speak to that directly, but we can do calibrations remotely without sending techs out. I'm told that the impressive thing is that our dilution fridges can run for several years
384.
by boothby 6y ago
There's a few out there; here's a couple that I'm familiar with. https://www.dwavesys.com/sites/default/files/Dwave_Menten%20... https://www.dwavesys.com/sites/default&#x2F
385.
by boothby 6y ago
If I know my history,* the first programmable classical computer was made in 1941; we had the D-Wave One programmable quantum computer in 2011. So... the 50s? * I don't, so I read a Wikipedia article or two
386.
by boothby 6y ago
We don't have a theoretical proof of a superpolynomial speedup on your favorite problem, no. But as a dear friend and colleague is fond of saying, "it works in theory -- but does it work in practice?" Not your favorite probl
387.
by boothby 6y ago
Last I heard (I work there, but not in hardware) it takes a couple of technicians a few weeks to install the machine onsite, but after that, they're extremely low maintenance. The skill required to use them "locally" is quit
388.
by boothby 6y ago
That's a press release, not a technical paper, so yeah, it's fairly lacking on technical details. Performance of quantum computers is rather difficult to summarize in an easily digestible measure, so press releases tend to cover
389.
What's it take to make a chip with over a million Josephson junctions?(arstechnica.com)
4 points by boothby 6y ago|1 comments
390.
by boothby 6y ago
Amusing historical note: D-Wave is so named because early in the company's history, we* wanted to do high-temperature, or even "desktop" quantum computing. In the process of hashing out implementation details, it became clea

More ›