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 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, a upper bound would be more useful to understand BB. But second, out of all large numbers, does this one give any information? Well 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…
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.
The caption on the close up says: “Details preserved on both face, face in the back in focus”. But it seems to me that a lot of detail is actually missing! On the later pictures you see a lot of skin “imperfections”,…
Wouldn’t it be just as easy to keep Fortran alive with ai?
I agree. But it’s cool to explore these things and if it’s the first time someone sees it, that’s nice!
Yes. A lot is not accessible if not logged in.
Doesn’t help with scrapers though. They use a unique IP for each query.
Sometimes you can use SMT for “theorem proving”. It is a rather broad term. I don’t think they added something much different than what they already had.
The recent proof of Fermats Last Theorem is interesting: it is (iirc) 13 million lines of lean code. And type-checking takes 5 hours or so on a pretty beefy machine. I cannot independently verify the proof, and I have…
I looked in the AppStore for “symmetry draw”, and there are at least 10 such apps.
Most systems i have seen are way beyond a 100 lines. And their GitHub repository contain many issues, often soundness bugs. (Granted, many get fixed very fast.)
This is a crucial point. There have been many bugs in Lean (and in other proof assistants for that matter). Proof assistants work well on human input, because it was created with a certain intent. We simply don’t know…
I guess it’s submitted for the method rather than the result.
It also depends on your screen brightness. In my case, if it’s set to maximum, there is no difference between SDR and HDR.
Absolutely amazing. I recently searched this and google images showed so much ai slop. I don’t get that, why do people prefer generic Disney style crystal caves above the actual photographs of this amazing cave.
The specification of qr codes says you should look only at the centres, iirc.
This is very similar to “Mosaic” on Simon Tatham’s puzzle webpage. There it is noted that: “This game is variously known in other locations as: ArtMosaico, Count and Darken, Cuenta Y Sombrea, Fill-a-Pix, Fill-In, Komsu…
Oh this reminds me that we used to create buttons for navigation in flash!
Market size is different: everyone needs a mail client, but not everyone needs 3d modelling.
Hmm strange, I have never had a thunderbird folder in my home dir. I use thunderbird on Mac, Windows and Linux (Ubuntu).
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 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, a upper bound would be more useful to understand BB. But second, out of all large numbers, does this one give any information? Well 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…
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.
The caption on the close up says: “Details preserved on both face, face in the back in focus”. But it seems to me that a lot of detail is actually missing! On the later pictures you see a lot of skin “imperfections”,…
Wouldn’t it be just as easy to keep Fortran alive with ai?
I agree. But it’s cool to explore these things and if it’s the first time someone sees it, that’s nice!
Yes. A lot is not accessible if not logged in.
Doesn’t help with scrapers though. They use a unique IP for each query.
Sometimes you can use SMT for “theorem proving”. It is a rather broad term. I don’t think they added something much different than what they already had.
The recent proof of Fermats Last Theorem is interesting: it is (iirc) 13 million lines of lean code. And type-checking takes 5 hours or so on a pretty beefy machine. I cannot independently verify the proof, and I have…
I looked in the AppStore for “symmetry draw”, and there are at least 10 such apps.
Most systems i have seen are way beyond a 100 lines. And their GitHub repository contain many issues, often soundness bugs. (Granted, many get fixed very fast.)
This is a crucial point. There have been many bugs in Lean (and in other proof assistants for that matter). Proof assistants work well on human input, because it was created with a certain intent. We simply don’t know…
I guess it’s submitted for the method rather than the result.
It also depends on your screen brightness. In my case, if it’s set to maximum, there is no difference between SDR and HDR.
Absolutely amazing. I recently searched this and google images showed so much ai slop. I don’t get that, why do people prefer generic Disney style crystal caves above the actual photographs of this amazing cave.
The specification of qr codes says you should look only at the centres, iirc.
This is very similar to “Mosaic” on Simon Tatham’s puzzle webpage. There it is noted that: “This game is variously known in other locations as: ArtMosaico, Count and Darken, Cuenta Y Sombrea, Fill-a-Pix, Fill-In, Komsu…
Oh this reminds me that we used to create buttons for navigation in flash!
Market size is different: everyone needs a mail client, but not everyone needs 3d modelling.
Hmm strange, I have never had a thunderbird folder in my home dir. I use thunderbird on Mac, Windows and Linux (Ubuntu).