Jaxan

I have a surface pro 4 and absolutely like touch. The combination of an actual keyboard and touch is very efficient.

I’ve always used parser combinaties in Haskell and I’ve never seen the things you describe. I guess in Haskell one always directly apply the parts to the function you want (ie an AST node constructor).

> i think for an experienced developer using claude the app itself would be easy to build

Maybe. But if everyone has to vibe code this themselves, it would be a hugely inefficient endeavour. Better to share these projects and help others!

I remember a rock paper scissors AI decades ago that did something similar.

> you can't have upper bound without breaking Turing and solving halting problem

Not in general, no. But for a fixed n, you can. For example, people have settled the exact value of BB(5).

First, an upper bound would be more useful to understand BB. But second, out of all large numbers, does this one give any information? We’ll have to see. The fact in itself is useless.

I don’t think such a bound in itself is interesting, unless the proof reveals some strategy to prove more. There are infinitely potential bounds to BB(n), why is this particular case BB(10) > G useful for understanding fast growing functions?

Oh, as soon as you add tls to your subdomain, the bots come. It’s instant.

It does have S/MIME, I think?

They mean a different statement, a different theorem. You have to understand that translating a theorem written in English text to lean code is also a non trivial step.

But it has. Think of design patterns and other programming paradigms (logic programming, functional programming, etc).

As someone who grew up with Milkdrop, these seem a bit dull/minimalistic.

Not only that, we also have code comments and standalone documentation.

You still need a mathematician to check the statement of the theorem.

Can’t you just open a folder inside your Dropbox folders? Then it should just sync, right?

(That’s how I use zettlr, but with nextcloud instead of Dropbox.)