firechickenbird

5 ms·

1.
by firechickenbird 10mo ago
The proof of non-regularity is a bit convoluted. You can easily apply the pumping lemma there
2.
Ask HN: How is Nvidia streaming 4k games while remote control sw is low q lag
3 points by firechickenbird 1y ago|1 comments
3.
by firechickenbird 2y ago
If we save billions there will be no space for other people
4.
by firechickenbird 2y ago
At first glance I thought SHALL standed for SHA-language model :|
5.
by firechickenbird 3y ago
With the upcoming recession and market crash it’s the perfect timing
6.
by firechickenbird 3y ago
Ima short this bubble to zero
7.
by firechickenbird 3y ago
Backprop doesn’t give a shit
8.
by firechickenbird 3y ago
Quality of these LCM is not the best though
9.
by firechickenbird 3y ago
Please don’t call this mess “type-safe”
10.
by firechickenbird 3y ago
I think your last chart is slightly incorrect: the game server is sending a message directly to the user, whereas it should theoretically only talk to the intermediate message queue (or frontend server)
11.
by firechickenbird 3y ago
Cool idea, but why such an overkill website? You could've just created a youtube playlist
12.
by firechickenbird 3y ago
Broken
13.
Ask HN: How to Sell an App?
1 points by firechickenbird 3y ago|1 comments
14.
by firechickenbird 3y ago
> The government hopes that the move will spur competition and lead to app price drops Most apps are free. The paid one are also already very cheap
15.
by firechickenbird 3y ago
My graph is a partial representation of the supermarket and does not contain all the goods. It has just the stuff that I've bought at least once and manually positioned into the nodes. Sometimes the supermarket decides to relocate grou
16.
by firechickenbird 3y ago
An app that helps me with shopping at my main supermarket. I usually go always to the same supermarket twice a week. I was frustrated that every time I changed something in my shopping list I had to mentally recompute the optimal path to pi
17.
by firechickenbird 3y ago
At this point I'm wondering if the TypeScript type system can be used for dependant types that would allow formal verification of the programs
18.
by firechickenbird 3y ago
No? In fact, if you understand what what I wrote, by generalizing this small piece of code it would mean that most of the codebase must be also partially rewritten to rust to be able to interoperate with the new data structures moved in ru
19.
by firechickenbird 3y ago
OP fully rewrote the example program in rust, by also moving the entire data structures there. This would mean that any interaction with these ndarrays could be possible only on the rust side, hence any other code that uses them must be rew
20.
by firechickenbird 3y ago
The premise was to not rewrite everything in rust, but you basically ended up rewriting 90% of it in rust
21.
by firechickenbird 3y ago
Why should I trust these random charts? Where do you get the data from? Feels like sponsored fake news by bing
22.
by firechickenbird 4y ago
Disable JS for full article
23.
by firechickenbird 4y ago
Very interesting, although I was expecting the Stable Diffusion paper[1] to be one of the most cited in 2022 [1]: High-Resolution Image Synthesis With Latent Diffusion Models, https://arxiv.org/abs/2112.10752
24.
Ask HN: Is this Generative AI hype healthy?
26 points by firechickenbird 4y ago|19 comments
25.
by firechickenbird 4y ago
Let me first try to briefly summarize NP-completeness: A problem A is NP-complete if: - you can verify it's solution in polynomial time - you can reduce it to any other NP-complete problem in polynomial time Since polynomial reduction
26.
by firechickenbird 4y ago
> That is not entirely true what are you referring to? Obviously x^4 != x^10, but noone has ever proven that "if SAT is P, then it would have the lowest (or highest) polynomial complexity among the other problems", or anything
27.
by firechickenbird 4y ago
Interesting informal summarization of SAT. However, there is no such thing as "the hardest" NP-complete problem. By definition of NP-completeness, if you solve ANY NP-complete problem in polynomial time, you can solve every other
28.
by firechickenbird 4y ago
> severely underhyped: voice AI These two words made it all sound like they are just trying to ride the AI wave instead of actually solving a real world problem
29.
Paywall? Disable JavaScript(vimeo.com)
2 points by firechickenbird 4y ago|1 comments
30.
by firechickenbird 4y ago
IMO CTOs must have a broad knowledge of how things are done in all the fields, eg. web, mobile, backend, devops, nowadays ML etc. That way they can take more sane high-level and long term technological decisions. Otherwise you end up with a

More ›