jmj

4 か月前議論

cvoss, ezwoodland, tromp and v64 made a good point. As v64 points I was thinking of a Combinatory Completeness not Turing Completeness. Dropping that requirement as cvoss, ezwoodland, tromp point you can simulate deletion (that's what quantum computing does btw see No-deleting theorem).

I see the endgame now, thanks guys.

jmj

4 か月前議論

S combinator always duplicates its last parameter, never deletes it. That's why K is needed for universality.

This can be proved by induction. Or you can cite Craig's theorem (the less known one) for that. See [1]

Honestly, I don't see the endgame here.

[1] https://math.stackexchange.com/questions/839926/is-there-a-p...

jmj

7 か月前議論

> The decline in allocative efficiency should be more of a main focus — we need to throw more of our intellectual capital at understanding how to increase competitiveness and the market potential for innovative firms and technologies, in the same way that we've focused on understanding how to make better technologies.

In layman terms, it’s the age of the startup.

jmj

9 か月前議論

OpenHands does that, I wrote about it if you search my submissions.

投稿

OpenHands Index

We are all becoming managers

コメント