doormatt

How is this a "fractal"?

I only can't find K, M, W, V and Z.

That was a wonderful read!

Gotcha! Appreciate the clarification!

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 make.

And your terms of service says:

We provide an online platform that allows users to upload images, drawings, and artwork and use our proprietary AI-powered technology to transform those images into animated videos. You may upload image files, customize certain settings related to the animation output, view and download the resulting videos, and manage their uploaded content and account. We reserve the right to establish limits on the file types, file sizes, and number of uploads permitted per user, and to modify those limits at any time. All video generation is performed automatically through a combination of AI and computer graphics technology.

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've read about Armstrong, absolutely no surprise there.

Reminds me of https://habitica.com

What exactly is "bunny hands"? I'm having difficulty picturing it.

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.

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 that he didn't speak the language is the concern.

Paul had moved all production to Sparkfun, as it was taking up too much of his time.

And this is Aristotle - https://aristotle.harmonic.fun/

It's an LLM.

That was an absolutely fantastic read!

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.

Works fine for me.

Is it just me, or is that entire article AI written?

For radio stations, the fix isn't fancy – just overdue.

This SCREAMS LLM.

What specifically disturbed you?

I don't think you do. Your solution will also only start "firing alerts" once a threshold has been breached.

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, memory, disk, processes) and spawns Claude agents to diagnose problems when thresholds are breached.

Surely you see the irony here...

I think you mean 24 bit. 8 bit would only be 256 colors total.

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.

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.

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.

Hell, most people are in a different book.

This is amazing!

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 been established. I agree the components may suggest difficulty in high-rigidity regions, but unless you formally prove that no polynomial-time Turing machine’s trajectory enters those regions, the P != NP conclusion doesn’t follow.

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 do you guarantee that these geometric constraints don’t impose an exponential slowdown on some Turing algorithms that would otherwise run in polynomial time? Specifically, where do you prove that no such algorithm is mapped into a high-rigidity trajectory with exponential execution time?

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 that modeling a polynomial-time Turing machine in Algphys necessarily results in a polynomial-time trajectory in your framework, across all problem instances? Specifically, how do you rule out the possibility that the mapping itself introduces exponential distortion in some cases?

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" instances could be solvable in polynomial time by some algorithm that doesn’t rely on geometric modeling or Hamiltonian dynamics?

How do you justify that every polynomial-time Turing machine algorithm can be modeled as a trajectory in your Hamiltonian system?

I hate to "take you on", but I don't get it...