doormatt

5 ms·

1.
by doormatt 21d ago
>This is the most dangerous automation. A heater stuck in the on position can kill the fish in hours, so I've really spent a lot of time and energy to ensure I've accounted for the failure modes and edge cases that could cause
2.
by doormatt 2mo ago
How is this a "fractal"?
3.
by doormatt 4mo ago
I only can't find K, M, W, V and Z.
4.
by doormatt 4mo ago
That was a wonderful read!
5.
by doormatt 4mo ago
Gotcha! Appreciate the clarification!
6.
by doormatt 4mo ago
Why does your about page say this then? >I want to build something with a low floor and a high ceiling; a tool that uses AI to smooth out the hardest parts of traditional animation, while letting creators keep full ownership of what they
7.
by doormatt 5mo ago
>Armstrong, Aldrin and Collins cursed fewer than 15 times during their moon-landing mission, based on NASA transcripts. Most of that came from command-module pilot Collins. Aldrin cursed just once and Armstrong didn’t at all. From what I
8.
by doormatt 6mo ago
Reminds me of https://habitica.com
9.
by doormatt 7mo ago
What exactly is "bunny hands"? I'm having difficulty picturing it.
10.
by doormatt 8mo ago
>Is there any way to trick Kiki? >Several users have tried. None have succeeded. But then >What browsers does Kiki support? >KIKI supports Chrome and Safari. Other browsers can confuse it. Stick to those two.
11.
by doormatt 8mo ago
> I had a friend whose son was placed in French immersion (a language he doesn't speak at all). In my entire french immersion Kindergarden class, there was a total of one child who already spoke French. I don't think the fact
12.
by doormatt 8mo ago
Paul had moved all production to Sparkfun, as it was taking up too much of his time.
13.
by doormatt 8mo ago
And this is Aristotle - https://aristotle.harmonic.fun/ It's an LLM.
14.
by doormatt 9mo ago
That was an absolutely fantastic read!
15.
by doormatt 9mo ago
I managed to go to the Star Trek Experience when it was in Vegas, and be transported in, walk through the corridors, and emerge onto the bridge. It was utterly glorious, and a good day to die.
16.
by doormatt 9mo ago
Works fine for me.
17.
by doormatt 10mo ago
Is it just me, or is that entire article AI written? >For radio stations, the fix isn't fancy – just overdue. This SCREAMS LLM.
18.
by doormatt 10mo ago
What specifically disturbed you?
19.
by doormatt 10mo ago
I don't think you do. Your solution will also only start "firing alerts" once a threshold has been breached.
20.
by doormatt 10mo ago
>When running multiple intensive processes in parallel, pushing machines to their limits to maximize throughput, traditional monitoring only provides alerts when thresholds breach. >Premortem continuously watches system vitals (CPU, m
21.
by doormatt 10mo ago
I think you mean 24 bit. 8 bit would only be 256 colors total.
22.
by doormatt 11mo ago
>the problem that people cannot think for themselves any longer (as seen by the downvoting in this submission). Quite an interesting take to assume that everyone who disagrees with you cannot think for themselves.
23.
by doormatt 11mo ago
>Wagner's office estimates he lost over $3,000 to downcoding in the first half of the year, but other doctors across the country have fared far worse. That's...not a lot of money.
24.
by doormatt 1y ago
I did once - but it was on purpose. After 4 years at AWS, and ~20 in the industry, I was utterly burnt out, and needed a break. So I took two years off.
25.
by doormatt 1y ago
Hell, most people are in a different book.
26.
by doormatt 1y ago
This is amazing!
27.
by doormatt 1y ago
Thanks so much for being so open and willing to discuss this! Just to be clear though, if that lemma isn’t yet explicitly proven, then the core claim (that Algphys cannot simulate certain NP-complete solutions in polynomial time) has not be
28.
by doormatt 1y ago
You mention that Algphys can simulate any polynomial-time Turing algorithm with preserved complexity, but in your construction, the dynamics of Algphys are governed by physical properties: gradient norms, Hessian spectra, rigidity, etc. How
29.
by doormatt 1y ago
Thanks for the reply! Just to clarify, your proof is relying on the assumption that if an algorithm can be modeled in Algphys, then its execution time in Algphys reflects its true time complexity, right? But can you point to where you prove
30.
by doormatt 1y ago
Just to clarify, how exactly does proving exponential lower bounds for Algphys translate into a proof that no polynomial time algorithm exists for NP-complete problems in the standard Turing model? Isn’t it possible that your "hard&quo

More ›