Recent submissions

Comment · 3 years ago
I guess back when I wrote it I didn't see the need given that single qubit gates along with CNOT are universal and they're implemented. I think airing on the side of 'as few features as is educational' was my mentality on this.
Comment · 3 years ago
I wrote something similar a couple of years ago - https://github.com/adamisntdead/QuSimPy

Happy to answer any questions people have, including on other simulation methods other than state vector!

Comment · 5 years ago
Comment · 5 years ago
If we're talking about Fun maths, there's a couple of really good channels that look at Olympiad problems.

- vEnhance (https://www.youtube.com/c/vEnhance), an MIT student and IMO Gold Medalist who solved problems live on stream (and plays various games)

- Osman Nal (https://www.youtube.com/c/OsmanNal), looking at problems ranging from AMC/AIME to IMO 3/6s

- Michael Greenberg (https://www.youtube.com/channel/UC3mhbGC7kQgzkXT9fceNOwA), a geometry enthusiast who also live solves problems, though the production quality isn't amazing

And of course, Michael Penn (but that's in the post above)!

Comment · 5 years ago
Comment · 5 years ago
I'm surprised that something like point compression can even be patented, considering that it's relatively straightforward mathematically (all of the difficulty seems to lie in the number theory to compute a solution, which I assume wasn't invented by whoever owned the patent)...
Comment · 7 years ago
Because the pacemakers rotated, they weren't the same all of the way through.
Comment · 8 years ago
That article had a really nice depth to it, answered all of my questions that I had yesterday when I first saw the project.
Comment · 8 years ago
Well if you get assigned bad seats you might not come back, for this sort of thing I would say happy customers would lead back into more money
Comment · 8 years ago
I have been thinking about this sort of thing quite a lot - while I do think it's wrong to split people up on a plane, it is quite an interesting concept.

A similar but less malicious case would be one of organising the seating on a train or in a cinema, but rather then biasing against families, biasing against other, unrelated groups.

For example - in a cinema, you usually do not wish to sit right beside another group when the rest of the seats are free. Still, you don't want to be that far from the center.

How do you design an algorithm for this? How will it scale? How can you make the most number of groups happy with their seats? How do you avoid having individual seats that nobody wants?

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton